| MINIMIZE: Z = 800 X1 + 1000 X2 |
| 2 X1 + 1 X2 ≥ 12 1 X1 + 3 X2 ≥ 18 2 X1 + 2 X2 ≥ 20 |
| 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 | 12 | 12000 |
| B | 6 | 0 | 4800 |
| C | 3.6 | 4.8 | 7680 |
| D | 2 | 8 | 9600 |
| E | 0 | 6 | 6000 |
| F | 18 | 0 | 14400 |
| G | 6 | 4 | 8800 |
| H | 0 | 10 | 10000 |
| I | 10 | 0 | 8000 |
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