Consider the following problem.

Maximize Z  3x1  2x2, subject to 2x1  x2 6 x1  2x2 6 and x1  0, x2  0.

(a) Use the graphical method to solve this problem. Circle all the corner points on the graph.

(b) For each CPF solution, identify the pair of constraint boundary equations it satisfies.

(c) For each CPF solution, identify its adjacent CPF solutions.

(d) Calculate Z for each CPF solution. Use this information to identify an optimal solution.

(e) Describe graphically what the simplex method does step by step to solve the problem.