Linear Programming

Many kinds of optimization problems can be expressed as linear programs (LPs). All LPs can be expressed in the following form: maximize $c^T x$ subject to the following constraints: $Ax=b$ and $x \geq 0$. In this formulation, $A$ is a matrix, and $b, c, x$ are vectors.