Consider the following linear programming problem: Maximise profit = 2X₁ - X₂ + 2X3 Subject to: 2X₁ + X₂ + 0x3 ≤10 X₁ + 2X₂ - 2X3 ≤ 20 0X₁ + X₂ + 2X3 ≤ 5 X₁ ,X2, X3 > 0 Change the objective function and constraints to simplex format by including the necessary additional variables.
Solve the problem above using the simplex method.
