compslack - OR 3300/5300 Optimization I Prof. Bland Fall...

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

View Full Document Right Arrow Icon
OR 3300/5300 Optimization I Fall 2011 Prof. Bland Complementary Slackness Part I: Motivating Complementary Slackness Consider the linear programming problem (P): maximize 6 x 1 + 14 x 2 + 13 x 3 + 30 x 4 subject to 1 2 x 1 + 2 x 2 + x 3 + 3 x 4 + 2 x 5 24 - x 1 + 4 x 2 + 4 x 3 - x 4 10 x 1 + 6 x 2 - 3 x 3 + x 5 20 ( P ) x 1 + 2 x 2 + 4 x 3 - 2 x 4 + 3 x 5 60 x 1 + x 2 + x 3 + x 4 + x 5 50 2 x 1 + 3 x 2 - x 3 + x 4 + 2 x 5 70 x 1 0 ,x 2 0 ,x 3 0 ,x 4 0 ,x 5 0 Proposed solution: b x 1 = 36 , b x 2 = 0 , b x 3 = 6 , b x 4 = b x 5 = 0 We want to check whether this solution is optimal. First check that it is feasible (it is). Duality tells us that if b x is optimal, there must exist a dual feasible b y with b yb = c b x . Let’s examine the implications of that. A b x = 24 24 - 12 10 18 20 60 60 42 50 66 70 = b
Background image of page 1

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

View Full DocumentRight Arrow Icon
b x T = 36 0 6 0 0 c = 6 14 13 30 0 b yA = Part II: Complementary Slackness (Read BHM section 4.5) Consider a standard form linear programming problem (P) and its dual (D):
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/08/2012 for the course ORIE 3300 at Cornell.

Page1 / 4

compslack - OR 3300/5300 Optimization I Prof. Bland Fall...

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

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