Sketch the feasible region of the linear program
maximise x0 = 3x1 + 2x2
subject to
-3x1 + x2⩽ 0
x1 - x2 ⩽ 1
3x1 + 2x2 ⩽ 13
x1; x2 ⩾ 0:
Identify an optimal solution and give its value. Are there any other
optimal solutions? If so, give one. Which, if any, constraints are
redundant?
(b) Use the Simplex method to solve the linear program given
in (a). Check that your solution satisfies the constraints.