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 slack variable X3.
- As the constraint 2 is of type '≤' we should add the slack variable X4.
- As the constraint 3 is of type '≤' we should add the slack variable X5.
- As the constraint 4 is of type '≤' we should add the slack variable X6.
| MAXIMIZE: Z = 10 X1 + 15 X2 |  | MAXIMIZE: Z = 10 X1 + 15 X2 + 0 X3 + 0 X4 + 0 X5 + 0 X6 |
subject to 1 X1 + 2 X2 ≤ 6000.125 X1 + 0.5 X2 ≤ 100 0.05 X1 + 0.33 X2 ≤ 60 1 X1 0 X2 ≤ 500 | subject to 1 X1 + 2 X2 + 1 X3 = 6000.125 X1 + 0.5 X2 + 1 X4 = 100 0.05 X1 + 0.33 X2 + 1 X5 = 60 1 X1 + 1 X6 = 500 | |
| X1, X2 ≥ 0 | X1, X2, X3, X4, X5, X6 ≥ 0 |
We'll build the first tableau of the Simplex method.