IOE510+Lecture+02+08+10+Mon

IOE510+Lecture+02+08+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 Monday February 8, 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 Exam next Monday! More info to come soon…
Background image of page 2
3 Re-cap from Last Time Proved optimality of extreme points Motivating the simplex method for solving linear programs
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 Optimality of Extreme Points
Background image of page 4
5 Optimal Points vs Extreme Points If a problem has an extreme point, does it have an optimal extreme point? Do unbounded problems have extreme points? Claim: If a problem has an optimal solution and has an EP , then it has an optimal EP If a problem has an EP, then it either has an optimal EP or is unbounded (i.e. has no optimal solution)
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 Algorithmic approach Enumerate all BFS’s and pick the one with the best objective value Problem 1: n-choose-m possible BFS’s Problem 2: Unbounded problems
Background image of page 6
7 Degeneracy and Adjacency
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 Degeneracy A basic feasible solution is said to be degenerate if it has more than n active constraints Can these all be linearly independent? What does this look like?
Background image of page 8
9 Adjacency Two basic solutions are adjacent if they share n – 1 linearly independent active constraints Two adjacent basic feasible solutions are connected by a line which is called an edge of the polyhedron
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 Optimality Conditions
Background image of page 10
11 Feasible Directions
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 / 24

IOE510+Lecture+02+08+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