Lecture 20110325

Lecture 20110325 - IMSE2008 Operational Research Techniques...

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

View Full Document Right Arrow Icon
IMSE2008 Operational Research Techniques ecture 03/25 Lecture 03/25 Duality Miao Song Dept of Industrial & Manufacturing Systems Engineering
Background image of page 1

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

View Full DocumentRight Arrow Icon
genda Agenda Duality Pricing Dual Problem Weak Duality and Strong Duality yg y Complementary Slackness 3/25/2011 2
Background image of page 2
Quick Review of Shadow Prices A Quick Review of Shadow Prices min z = 3x 1 – 2x 2 s.t. –3x 1 + 3x 2 + x 3 = 6 x 2x x 2 Shadow Prices –1/3 /2 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 –1/2 Suppose that the 6 on the RHS decreases from 6 to 5.6. What is the impact on the optimal obj value? uppose that the 6 on the RHS increases from 6 to 7 Suppose that the 6 on the RHS increases from 6 to 7. What is the impact on the optimal obj value? Suppose that the 2 on the RHS decreases from 2 to 1.7. What is the impact on the optimal obj value? Do we need any assumption in the calculations? tay in the allowable range of the shadow price 3/25/2011 3 Stay in the allowable range of the shadow price
Background image of page 3

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

View Full DocumentRight Arrow Icon
Quick Review of Shadow Prices A Quick Review of Shadow Prices min z = 3x 1 – 2x 2 s.t. –3x 1 + 3x 2 + x 3 = 6 x 2x x 2 Shadow Prices –1/3 /2 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 –1/2 What are the optimal reduced cost for each decision variable? n i i j i j j s a c c 1 , What are the basic variables? 3/25/2011 4
Background image of page 4
rices for a Linear Program Prices for a Linear Program min z = 3x 1 – 2x 2 s.t. –3x 1 + 3x 2 + x 3 = 6 x 2x x 2 Prices 0.33 7 2 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 –17.2 A set of prices for a linear program is a collection of real numbers associated with each constraint, other than the onnegativity constraints nonnegativity constraints Shadow prices are some special prices for the LP 3/25/2011 5
Background image of page 5

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

View Full DocumentRight Arrow Icon
ricing Out to Get Reduced Costs Pricing Out to Get Reduced Costs min z = 3x 1 – 2x 2 s.t. –3x 1 + 3x 2 + x 3 = 6 x 2x x 2 Prices –1 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 –2 Optimal reduced cost = original costs minus column coefficients time shadow prices Reduced cost = original costs minus column coefficients time prices n i i j i j p a c 1 , 3/25/2011 6
Background image of page 6
ricing Out to Get Reduced Costs Pricing Out to Get Reduced Costs min z = 3x 1 – 2x 2 s.t. –3x 1 + 3x 2 + x 3 = 6 x 2x x 2 min –8x 1 + 5x 2 + x 3 + 2x 4 – 10 s.t. –3x 1 + 3x 2 + x 3 = 6 x x 2 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 –4x 1 + 2x 2 + x 4 = 2 x 1 ,x 2 ,x 3 ,x 4 0 Are these two problems equivalent? Do they have the same optimal solution & optimal value? For a problem with equality constraints, optimizing wrt to the reduced costs is the same as optimizing wrt the riginal costs original costs 3/25/2011 7
Background image of page 7

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

View Full DocumentRight Arrow Icon
genda Agenda Duality Pricing rices: real numbers assigned to constraints Prices: real numbers assigned to constraints Reduced costs can be obtained from prices Optimizing wrt reduced costs is equivalent to optimizing wrt original costs
Background image of page 8
Image of page 9
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/09/2011 for the course IMSE 0301 taught by Professor Song during the Spring '11 term at HKU.

Page1 / 23

Lecture 20110325 - IMSE2008 Operational Research Techniques...

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

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