Consider the following Linear Programming Problem: MIN Z= 6x1 + 4x2
2x1 + x2 ?12 (1) x1 + x2 ? 10 (2) x2 ?4 (3) x1, x2 ? 0
(a) On the provided graph paper, graph the constraints, and specify the direction of feasibility for each one. Then, clearly indicate the feasible region on your graph, and label your corner points on it (e.g., A, B, etc.) No need to determine the coordinates of all corner points.
(b) Graph an objective function line. What is the optimal solution? What is the optimal objective value?