lecture 7 - Math 482(Lecture 7 The two phase simplex method...

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

View Full Document Right Arrow Icon
Math 482 (Lecture 7): The two phase simplex method This lecture covers Section 2.8 of the textbook. I have also attached the following notes. Lectures 5 and 6 show that assuming we start with a basic feasible solution, then the simplex method will complete, and we will decide A. The problem has a finite minimum, and a bfs that attains this min. B. The problem is unbounded. However, it can happen that C. The problem is infeasible. D. The problem is feasible, but you aren't able to immediately detect a bfs. (With regards to D., we've been focusing on the very good case that the problem has an "obvious" basis and the coefficient vector b is nonnegative.) The first phase of the two phase simplex method determines if C happens, or otherwise finds us a bfs. (The second phase is what was covered in lectures 5 and 6.) Example: See here. Phase 1 summary: * Negate if necessary all constraints so that the coefficients are all positive. * Add slack variables to as many equations as necessary so as to obtain an "obvious"
Background image of page 1

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

View Full Document Right Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 2

lecture 7 - Math 482(Lecture 7 The two phase simplex method...

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