Simplex algorithm: Difference between revisions

Content deleted Content added
m linking
Line 116:
:<math>z(\mathbf{x})=z_B+\text{nonnegative terms corresponding to nonbasic variables}</math>
 
Note that byBy changing the entering variable choice rule so that it selects a column where the entry in the objective row is negative, the algorithm is changed so that it finds the maximum of the objective function rather than the minimum.
 
===Leaving variable selection===