, 
,
and 
.
We will now describe how the simplex method (an algebraic procedure) obtains this solution algebraically.
| Algebraic Simplex Method - Introduction | Previous | Next |
| To demonstrate the simplex method, consider the following linear programming model: | |
|
|
| This is the model for Leo Coco's problem presented in the demo, Graphical Method. That demo describes how to find the optimal solution graphically, as displayed on the right. | |
| Thus the optimal solution is , ,
and .
We will now describe how the simplex method (an algebraic procedure) obtains this solution algebraically. |