# csexL - Duality tells us that if b x is optimal, there must...

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

OR 320/520 Optimization I 10/30/07 Prof. Bland 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).

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Duality tells us that if b x is optimal, there must exist a dual feasible b y with b yb = c b x . Lets examine the implications of that. A c x = 24 24-12 10 18 20 60 60 42 50 66 70 = b c x T = 36 6 c = 6 14 13 30 c yA =...
View Full Document

## This note was uploaded on 03/30/2008 for the course ORIE 320 taught by Professor Bland during the Fall '07 term at Cornell.

### Page1 / 2

csexL - Duality tells us that if b x is optimal, there must...

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

View Full Document
Ask a homework question - tutors are online