Consider the following linear programming problem: Maximise Z = 4x1 − 4x2
subject to − 2x1 + 2x2 ≤ 4
2x1 − 2x2 ≤ 6
− x1 + 4x2 ≥ −2
x1 ≥ 0, x2 ≥ 0.
Solve the problem using simplex method (algebraically). If there are more than one optimal solution, give a complete characterisation to the solutions.
