Lecture10

Lecture10 - Introduction to Mathematical Programming IE406...

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

View Full Document Right Arrow Icon
Introduction to Mathematical Programming IE406 Lecture 10 Dr. Ted Ralphs
Background image of page 1

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

View Full DocumentRight Arrow Icon
IE406 Lecture 10 1 Reading for This Lecture Bertsimas 4.1-4.3
Background image of page 2
IE406 Lecture 10 2 Duality Theory: Motivation Consider the following minimization problem min x 2 + y 2 s.t. x + y = 1 How could we solve this problem? Idea : Consider the function L ( x, y, p ) = x 2 + y 2 + p (1 - x - y ) What can we do with this?
Background image of page 3

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

View Full DocumentRight Arrow Icon
IE406 Lecture 10 3 Lagrange Multipliers The idea is not to strictly enforce the constraints. We associate a Lagrange multiplier, or price , with each constraint. Then we allow the constraint to be violated for a price . Consider an LP in standard form. Using Lagrange multipliers, we can formulate an alternative LP: min c ± x + p ± ( b - Ax ) s.t. x 0 How does the optimal solution of this compare to the original optimum?
Background image of page 4
IE406 Lecture 10 4 Lagrange Multipliers Because we haven’t changed the cost of feasible solutions to the original problem, this new problem gives a lower bound . g
Background image of page 5

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

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

Page1 / 14

Lecture10 - Introduction to Mathematical Programming IE406...

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

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