PART II: Advanced Graphic Solution for Linear Programming.

Given the following linear programming problem:

Maximize(profit) Z = 30X1 + 10X2

subject to:

X1 + X2 5

(2) X1 + 2X2 6

(3) 5X1 + 2X2 10

(4) 2X1 - 3X2 6

(5) -3 X1 + 2X2 6

(6) X1 - 2X2 0

X1 0, X2 0

(a) Plot each constraint in the graph and identify it by crosshatching or shading the appropriate area graph.

(b) Identify the iso-profit line and optimal solution point (i.e., extreme point) on a graph.

(c ) Compute the exact coordinates of the optimal solution(i.e., find the optimal solution point) and the maximum profit.

(d) Identify which constraint (s) is (are) redundant?