Question: Consider the following single-constraint primal linear programming problem:
(a) Formulate the dual problem PD. How many variables does it have?
(b) Show that PD can be solved by simple inspection. State the optimal solution and objective function value of PD. Explain why = D.
(c) Using duality relationships, find the unique optimal solution to P.