IOE510+Lecture+03+08+10+Mon

IOE510+Lecture+03+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 Wednesday February 3, 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 Reminder of paper- instead of electronic- homework submission
Background image of page 2
3 Re-cap from Last Time Constructing Existence of extreme points What is a “line”?
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 Constructing Extreme Points in Standard Form
Background image of page 4
5 Polyhedra in Standard Form We will focus on polyhedra of the form: Min cx St Ax = b x > 0 The equations Ax = b defines an affine subspace (loosely, a plane) The polyhedron is the intersection of this affine subspace with the positive orthant
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 Polyhedra in Standard Form A basic feasible solution must have n lienarly independent active constraints The m equality constraints must be satisfied This leaves n – m more constraints Our only choice is the non-negativity constraints So the basic feasible solutions are at the intersection of the constraints x i = 0
Background image of page 6
7 Informal Idea To find a basic feasible solution, choose n - m variables and set them to zero This leaves m equations and m unknowns If these equations are not linearly independent, then this is not a basis – disregard If these equations are linearly independent, then they yield a basis In particular, they yield a unique solution in which n constraints are active; we call this a basic solution We call the variables set to zero non-basic and the remaining variables basic If all of the basic variables are non-negative, then it is also a basic feasible solution
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 Existence of Extreme Points
Background image of page 8
9 Lines and Extreme Points Claim: Given a non-empty polyhedron in the form Ax > b, the following are equivalent: a) P has at least one extreme point b) P does not contain a line c) There exist n vectors {a i } corresponding to constraints in P that are linearly independent Proof: Lemma 1) b implies a Lemma 2) c implies b Lemma 3) a implies c
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 Lines and Extreme Points Lemma 1) No line implies at least one EP Proof by construction: Let x be any point in P Case 1: x is an extreme point – complete
Background image of page 10
11 Lines and Extreme Points Proof (cont.): Case 2: x is not an extreme point
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 / 36

IOE510+Lecture+03+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