| MINIMIZE: Z = 60 X1 + 40 X2 |
| 1 X1 + 1 X2 ≥ 150 1 X1 -2 X2 ≥ 0 |
| 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 | 150 | 6000 |
| B | 150 | 0 | 9000 |
| C | 100 | 50 | 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