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 X4.
- As the constraint 2 is of type '≤' we should add the slack variable X5.
- As the constraint 3 is of type '≤' we should add the slack variable X6.
| MAXIMIZE: Z = 32 X1 + 44 X2 + 27.5 X3 |  | MAXIMIZE: Z = 32 X1 + 44 X2 + 27.5 X3 + 0 X4 + 0 X5 + 0 X6 |
subject to 5 X1 + 6 X2 + 2.5 X3 ≤ 26110 X1 + 10 X2 + 5 X3 ≤ 450 12 X1 + 20 X2 + 15 X3 ≤ 900 | subject to 5 X1 + 6 X2 + 2.5 X3 + 1 X4 = 26110 X1 + 10 X2 + 5 X3 + 1 X5 = 450 12 X1 + 20 X2 + 15 X3 + 1 X6 = 900 | |
| X1, X2, X3 ≥ 0 | X1, X2, X3, X4, X5, X6 ≥ 0 |
We'll build the first tableau of the Simplex method.