Consider Paul Jordan's following linear programming formulation: Minimize $4X_1 + $5X_2
1X_1 + 3X_2 ≥ 75 (C_1)
8X_1 + 2X_2 ≥ 152 (C_2)
3X_1 + 2X_2 ≥ 108 (C_3)
1X_2 ≤ 70 (C_4)
X_1, X_2 ≥ 0
a) On the graph on right, constraints C_1, C_2, C_3, and C_4 have been plotted.
Using the point drawing tool, plot all the corner points for the feasible area.
The optimum solution is:
X_1 = (round your response to two decimal places).
X_2 = (round your response to two decimal places).
b) Optimal solution value 'Z' = (round your response to two decimal places).