This preview shows page 1. Sign up to view the full content.
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 coecient of x in the constraint? 1...
View
Full
Document
This homework help was uploaded on 02/20/2009 for the course ORIE 3300 taught by Professor Todd during the Fall '08 term at Cornell University (Engineering School).
 Fall '08
 TODD

Click to edit the document details