Sol7 - C O350 L INEAR O PTIMIZATION S OLUTION HW7 Exercise 4.8.9 Claim The LP(P min subject to is unbounded if and only if the system Ax = 0 has a

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CO350 LINEAR OPTIMIZATION - SOLUTION HW7 Exercise 4.8.9 Claim. The LP (P): min e T x subject to Ax = 0 x 0 is unbounded, if and only if, the system Ax = 0 x 0 x 6 = 0 (i) has a solution. Proof. Suppose (P) is unbounded. Then there exists a non-trivial solution to { Ax = 0 ,x 0 } which is a solution to (i). Suppose (i) has a non-zero solution x * , then for any λ 0 , λx * is a feasible solution to (P) of value λe T x * where e T x * > 0 . Hence (P) is unbounded. / The dual of (D) is given by min 0 T y subject to A T y e Suppose (i) has a solution. Then by the Claim, (P) is unbounded. It follows from weak duality that (D) is infeasible, so (ii) has no solution. Suppose (ii) has a solution. Clearly, (D) cannot be unbounded, since its objective function is 0 . It follows from strong duality that (P) has an optimal solution. By the claim, (i) has no solution. Exercise 1 (a) Suppose that C is not convex. Then there exist two elements x 1 ,x 2 C and a real number λ [0 , 1] such that
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2010 for the course CO 350 taught by Professor S.furino,b.guenin during the Winter '07 term at Waterloo.

Page1 / 2

Sol7 - C O350 L INEAR O PTIMIZATION S OLUTION HW7 Exercise 4.8.9 Claim The LP(P min subject to is unbounded if and only if the system Ax = 0 has a

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online