IOE510+Lecture+02+24+10+Wed

# IOE510+Lecture+02+24+10+Wed - IOE 510 Linear Programming I...

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

1 IOE 510 Linear Programming I Wednesday February 24, 2010 Professor Amy Cohn

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

View Full Document
2 Announcements Re-grade policy No problem set 7
3 Re-cap from Last Time Finalizing simplex method “Big-M” method for generating initial BFS Some observations about degeneracy

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

View Full Document
4 Generating An Initial BFS Consider an LP of the form Min cx St Ax = b x > 0 WLOG assume b i > 0 for all i
5 A New LP (The Big-M Method) Construct a new LP: Min cx + Mey St Ax + Iy = b x > 0 y > 0 where y R m , e is a row vector in R m containing all 1’s, and M is a “very large number”

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

View Full Document
6 Example Min 2x 1 + 3x 2 + 4x 3 St x 1 – x 2 = 7 x 1 + x 2 – x 3 = 3 x 1 , x 2 , x 3 > 0 Min 2x 1 + 3x 2 + 4x 3 + My 1 + My 2 St x 1 – x 2 + y 1 = 7 x 1 + x 2 – x 3 + y 2 = 3 x 1 , x 2 , x 3 , y 1 , y 2 > 0 What is the initial basis? What is the first pivot?
7 Solving the New Problem Claim: (x = 0, y = b) is a BFS to this new problem Given this initial BFS, we can solve the new problem using the simplex algorithm Let (x*, y*) be an optimal solution to the new problem

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.

## 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 / 13

IOE510+Lecture+02+24+10+Wed - IOE 510 Linear Programming I...

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

View Full Document
Ask a homework question - tutors are online