The problem is converted to canonical form by adding slack, surplus and artificial variables as appropiate (show/hide details)
- As the constraint 1 is of type '≥' we should add the surplus variable X3 and the artificial variable X5.
- As the constraint 2 is of type '≥', and the independent term is negative or zero (the constraint is multiplied by -1), we should add the slack variable X4.
| MINIMIZE: Z = 60 X1 + 40 X2 |  | MAXIMIZE: Z = -60 X1 -40 X2 + 0 X3 + 0 X4 + 0 X5 |
subject to 1 X1 + 1 X2 ≥ 1501 X1 -2 X2 ≥ 0 | subject to 1 X1 + 1 X2 -1 X3 + 1 X5 = 150-1 X1 + 2 X2 + 1 X4 = 0 | |
| X1, X2 ≥ 0 | X1, X2, X3, X4, X5 ≥ 0 |
We'll build the first tableau of Phase I from Two Phase Simplex method.