Question: Consider the following linear programming problem
![1093_Max az.png](https://secure.tutorsglobe.com/CMSImages/1093_Max az.png)
(a) Graph the constraints, determine the feasible set, and use the graphical solution method to determine the optimal solution point. Which constraints are binding at optimum? Compute the exact coordinates at optimum and calculate the value of the objective function at optimum.
(b) Repeat (a) with the objective function Min z = x2.
(c) What happens if constraint I were of the type ≤ instead?