Content deleted Content added
No edit summary |
|||
Line 11:
\end{array}
</math>
where <math>\boldsymbol{A} \in \mathbb{R}^{m \times n}</math>. Without loss of generality, it is assumed that the constraint matrix <math>\boldsymbol{A}</math> has full row rank and that the problem is feasible, i.e., there is at least one <math>\boldsymbol{x} \ge \boldsymbol{0}</math> such that <math>\boldsymbol{Ax} = \boldsymbol{b}</math>. If <math>\boldsymbol{A}</math> is rank-deficient, either there are redundant constraints, or the problem is infeasible. Both situations can be handled by a presolve step.
==Algorithmic description==
| |||