lect5 - ISE 536Fall03: Linear Programming and Extensions...

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

View Full Document Right Arrow Icon
ISE 536–Fall03: Linear Programming and Extensions September 15, 2003 Lecture 5: Geometry, Optimality of BFS Lecturer: Fernando Ord´o˜nez 1 Existence of a BFS Theorem 1. P = { x ∈ < n | Ax b } 6 = . P has a BFS iff P does not contain a line Proof: pg. 63-64. Check that this result implies the following Bounded polyhedra must have a BFS A polyhedra in standard form must have a BFS 2 Optimality of a BFS Theorem 2. If min { c t x | Ax = b, x 0 } has an optimal solution then there is an optimal BFS proof: Consider Q = { x | c t x = z * , Ax = b, x 0 } 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
3 Unbounded Polyhedra and Extreme Rays Consider P = { x | Ax = b, x 0 } an unbounded polyhedra. Therefore there is a direction
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/13/2012 for the course ISE 536 taught by Professor Yy during the Spring '05 term at South Carolina.

Page1 / 2

lect5 - ISE 536Fall03: Linear Programming and Extensions...

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

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