next up previous contents
Next: Solution of Linear Programs Up: The Simplex Method Previous: The Simplex Method

Linear Programs in Standard Form

Before we start discussing the simplex method, we point out that every linear program can be converted into ``standard'' form


where the objective is maximized, the constraints are equalities and the variables are all nonnegative.

This is done as follows:


Let us first turn the objective into a max and the constraints into equalities.


The last step is to convert the unrestricted variable tex2html_wrap_inline5252 into two nonnegative variables: tex2html_wrap_inline8152 .


Michael A. Trick
Mon Aug 24 16:30:59 EDT 1998