| MINIMIZE: Z = 12000 X1 + 10000 X2 |
| 200 X1 + 100 X2 ≥ 800 300 X1 + 100 X2 ≥ 900 200 X1 + 200 X2 ≥ 1000 |
| X1, X2 ≥ 0 |
The problem is unbounded but since it is a minimizing problem can find a solution.
| Point | X coordinate (X1) | Y coordinate (X2) | Value of the objetive function (Z) |
| O | 0 | 0 | 0 |
| A | 0 | 8 | 80000 |
| B | 4 | 0 | 48000 |
| C | 1 | 6 | 72000 |
| D | 3 | 2 | 56000 |
| E | 0 | 9 | 90000 |
| F | 3 | 0 | 36000 |
| G | 2 | 3 | 54000 |
| H | 0 | 5 | 50000 |
| I | 5 | 0 | 60000 |
NOTE:
In green the points where the solution is located.
In red the points that not belong to the feasible region.
Solve using the Simplex method