Question: Consider the linear programming problem
Maximize P = 3x + 2y
subject to x - y ≤ 3
x ≤ 2
x ≥ 0, y ≥ 0
a. Sketch the feasible set for the linear programming problem.
b. Show that the linear programming problem is unbounded.
c. Solve the linear programming problem using the simplex method. How does the method break down?
d. Explain why the result in part (c) implies that no solution exists for the linear programming problem.