Unformatted text preview: maximize x (P) x = 1 x ≥ , with a single constraint on a single variable x . (a) What is the dual problem (D)? (b) For each of (P) and (D), state whether it is infeasible, unbounded, or has an optimal solution. (c) Now suppose the “0” in the constraint is replaced by a small number ± > 0. How does your answer in (b) change? What if it is replaced by± ? If you call the optimal value of an infeasible maximization problem∞ and that of an unbounded maximization problem + ∞ , how does the optimal value of (P) vary as a function of a , the coeﬃcient of x in the constraint? 1...
View
Full Document
 Fall '08
 TODD
 Linear Programming, Optimization, optimal solution, linear programming problem

Click to edit the document details