This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: STOR 415 HANDOUT Two-phase Simplex algorithm Given any LP in general form, we can always convert it into standard form. If the standard-form LP turns out be in canonical form, then one can apply the simplex method right away. Otherwise, one needs to go through extra steps. The entire procedure is what we call the two-phase simplex algorithm . Step 0. Start with an LP in standard form. max z = c T x s.t. Ax = b , x ≥ Step 1. Make the rhs nonnegative, by multiplying equations with negative right- hand-side by- 1. After this step, we have b ≥ . Step 2. Add one nonnegative artificial variable to each equation. Ignore the original LP’s objective function, and set the objective function to be maxi- mizing the sum of the negatives of all artificial variables. The resulted LP is called the Phase I LP . max t =- y 1- y 2-···- y m s.t. Ax + y = b , x ≥ y ≥ Then express the objective function of the phase I LP as a function of the non-artificial variables. The phase I LP is now in canonical form. The original LP is feasible if and only if the optimal value of the Phase I LP is zero....
View Full Document
This note was uploaded on 05/10/2011 for the course STOR 415 taught by Professor Shulu during the Spring '11 term at University of North Carolina School of the Arts.
- Spring '11