IOE510+Lecture+03+10+10+Mon

IOE510+Lecture+03+10+10+Mon - IOE 510 Linear Programming I...

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

View Full Document Right Arrow Icon
1 IOE 510 Linear Programming I Wednesday March 10, 2010 Professor Amy Cohn
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 Announcements Problem set 8 due today; problem set 9 to be posted tomorrow
Background image of page 2
3 Re-cap from Last Time Duality – using penalties to enforce constraints
Background image of page 3

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

View Full DocumentRight Arrow Icon
4 Duality
Background image of page 4
5 Another Example Primal problem: Min 3x + 2y - z St x - y + z > 2 5y > 3 x, y, z > 0
Background image of page 5

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

View Full DocumentRight Arrow Icon
6 Example, cont. Given that we have two constraints, we’ll consider two different penalties: Min 3x + 2y - z St x - y + z > 2 (p 1 ) 5y > 3 (p 2 ) x, y, z > 0
Background image of page 6
7 Example, cont. D(p 1 , p 2 ) becomes: Min 3x + 2y – z + p 1 (2 – x + y - z) + p 2 (3 – 5y) St x, y, z > 0
Background image of page 7

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

View Full DocumentRight Arrow Icon
8 Example, cont. D(p 1 , p 2 ): can be re-written as Min 2p 1 + 3p 2 + (3 – p 1 ) x + (2 + p 1 – 5p 2 ) y + (-1 –p 1 ) z St x, y, z > 0 What can we say about the solution to this problem for given values of p 1 and p 2 ? Derive the dual problem…
Background image of page 8
9 Taking Duals for Generic LP Forms If a primal constraint is > , the dual variable is > 0 If a primal constraint is =, the dual variable is free If a primal constraint is < , the dual variable is < 0 If a primal variable is > 0 , the dual constraint is < If a primal variable is free, the dual constraint is = If a primal variable is < 0, the dual constraint is >
Background image of page 9

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

View Full DocumentRight Arrow Icon
10 Shortcut to Finding the Dual The dual of Min cx St Ax > b x > 0 is Max b T p St A T p < c T p > 0
Background image of page 10
11 Claim
Background image of page 11

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

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

This note was uploaded on 04/11/2010 for the course IOE 510 taught by Professor Staff during the Fall '08 term at University of Michigan.

Page1 / 29

IOE510+Lecture+03+10+10+Mon - IOE 510 Linear Programming I...

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

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