| Tabular Simplex Method - Checking Optimality | Previous | Next |
|
|
| Checking for Optimality | |
| This ends iteration 3. | |
| Is the current basic feasible solution optimal? Yes. | |
| Why? Because row 0 does not include any negative coefficients. | |
| This concludes the demonstration. See the OR Tutor menu (to the left) for other demonstrations or close the browser window to exit OR Tutor. | |