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.
| MAXIMIZE: Z = 3 X1 + 2 X2 |  | MAXIMIZE: Z = 3 X1 + 2 X2 + 0 X3 + 0 X4 + 0 X5 |
subject to 2 X1 + 1 X2 ≤ 182 X1 + 3 X2 ≤ 42 3 X1 + 1 X2 ≤ 24 | subject to 2 X1 + 1 X2 + 1 X3 = 182 X1 + 3 X2 + 1 X4 = 42 3 X1 + 1 X2 + 1 X5 = 24 | |
| X1, X2 ≥ 0 | X1, X2, X3, X4, X5 ≥ 0 |
We'll build the first tableau of the Simplex method.