This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: OTHER FORMS AND CASES OF LPs Objective function may be a minimum. The linear Program may have multiple solutions. The linear program may be unbounded. The constraints may be equality or greater than inequality. Variables may be less that equal to 0 or unrestricted in sign. The linear program may have no feasible solution. Saigal (U of M) IOE 310 1 / 13 PHASE 1 PHASE 2 METHOD I Step 1 Modify constraints so that the RHS is nonnegative. Step 2 Convert to standard form by adding slack or excess variables. Step 3 Add an artificial variable to each constraint that has either an equality or an inequality. Step 4 Replace the original objective function with minimize w = sum of all the artificial variables, and solve this LP. Saigal (U of M) IOE 310 2 / 13 SOLVING THE PHASE 1 LP I Solve by the simplex algorithm this LP. At the end, either this LP will have an optimal solution w = 0 or w > 0. If the optimal solution is w > 0, the original LP has no feasible solution....
View
Full
Document
This note was uploaded on 04/02/2008 for the course IOE 310 taught by Professor Saigal during the Spring '08 term at University of Michigan.
 Spring '08
 Saigal

Click to edit the document details