Consider the following problem.

Maximize Z  x1  x2, subject to x1  x2 8 x2 3

x1  x2 2 and x1 0, x2 0.

(a) Solve this problem graphically.

(b) Use the dual simplex method manually to solve this problem.

(c) Trace graphically the path taken by the dual simplex method.