Unformatted text preview: Problem 2. Consider the LP problem: min 2 x 1 + x 2 s.t. 3 x 1 + x 2 ≥ 6 x 1 + x 2 ≥ 4 x 1 , x 2 ≥ . 1. After putting it in standard form, verify that the basis B = { 1 , 2 } is optimal. 2. Add the constraint x 1 +3 x 2 = α . For what value of α is the problem feasible? 3. Choose an α such that the problem is feasible and perform the necessary operations to ²nd the new optimal solution. Problem 3. Consider the LP problem: min (1α ) x 1 + (2 + α ) x 2 s.t. 3 x 1 + x 2 ≤ 9 x 1 + x 2 ≥ 5 x 1 , x 2 ≥ . For α = 0, this is equivalent to the LP in Problem 1. Compute the values of α such that the problem is infeasible, unbounded, or has a ²nite optimal solution....
View
Full Document
 Fall '08
 Staff
 Math, Operations Research, Optimization, 50%, LP, two days

Click to edit the document details