Questions that relates to the "simplex algorithm", from the mathematical optimization field
The Simplex Algorithm (Simplex Method), created by George Bernard Dantzig, operates on linear programs of the following canonical form:
\begin{align}\max\quad&c^\top x\\\text{s.t.}\quad& Ax\le b\\\quad & x\ge 0\end{align}
where,
$x=(x_{1},x_{2},\cdots,x_{N})$
$c=(c_{1},c_{2},\cdots,c_{N})$ where $c$ are the coefficients of the objective $A$, which is a $p\times n$ matrix
$b=(b_{1},b_{2},\cdots,b_{N})$ is non-negative
There is a straightforward process to convert any linear program into one in standard form, so using this form of linear program results in no loss of generality.
Reference:
