This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 2. 6.46 (b) 3. Consider the following problem: max x 1 + tx 2 x 2 2 2 x 1 + 2 x 2 7 x 1 2 10 x 1 + x 2 21 x 1 + 10 x 2 21 x 1 ,x 2 , where t is a parameter. Graph the feasible set. Solve the problem for t =1 , , . 1 , 1 , 5 , 10 , 20 and graph the optimal objective value as a function of t . How does the optimal solution change as t changes? You are encouraged to use computer tools to graph and solve the problem, but you must show some evidence of how you solved the problem (EXCEL or GAMS printout, or one of the tools that I suggested). 4. 9.31 (a) and (b) 5. 9.43...
View
Full
Document
This note was uploaded on 11/03/2008 for the course IE 220 taught by Professor Storer during the Spring '07 term at Lehigh University .
 Spring '07
 Storer
 Operations Research

Click to edit the document details