Content deleted Content added
→Degeneracy: stalling and cycling: wikilink |
m linking |
||
Line 42:
The second equation may be used to eliminate <math>x_1</math> from the linear program. In this way, all lower bound constraints may be changed to non-negativity restrictions.
Second, for each remaining inequality constraint, a new variable, called a ''[[slack variable]]'', is introduced to change the constraint to an equality constraint. This variable represents the difference between the two sides of the inequality and is assumed to be non-negative. For example, the inequalities
:<math> \begin{align}
x_2 + 2x_3 &\le 3\\
| |||