Linear programming: Difference between revisions

Content deleted Content added
top: reformulated for a bit more mathematical rigour/coherence
Standard form: corrected: set-builder expression should always state which bound variable(s) is introduces; was not the case
Line 55:
 
The problem is usually expressed in ''[[Matrix (mathematics)|matrix]] form'', and then becomes:
: <math>\max \{\, \mathbf{c}^\mathrm{T} \mathbf{x} \;|mid \;mathbf{x}\in\mathbb{R}^n\land A \mathbf{x} \leq \mathbf{b} \land \mathbf{x} \geq 0 \,\}</math>
 
Other forms, such as minimization problems, problems with constraints on alternative forms, as well as problems involving negative [[variable (programming)|variables]] can always be rewritten into an equivalent problem in standard form.