MIE376 Lec 2 - Simplex.page50

# MIE376 Lec 2 - Simplex.page50 - How do we make sure it is...

This preview shows page 1. Sign up to view the full content.

MIE376 - Mathematical Programmingt 50 Solve for Basic Variables ± Equations in previous iteration: ² x 1 + 3*x 2 + x 3 = 16 ² x 1 + x 2 +x 4 = 7 ² x 1 –3x 2 = 10 ² Z = x 1 + 2*x 2 ± Express basic variables and objective in terms of non-basic var. ² x 3 = 16 – x 1 –3*x 2 ² x 4 = 7 – x 1 –x 2 ² 3 rd equation ± has all non-basic variables!
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: How do we make sure it is satisfied? Every LP requires a variable unique to each constraint Introduce again an artificial variable Solve with either Big-M or 2-Phase method To find there is no feasible solution! x 2 x 1 x 3 x 4 x 5...
View Full Document

## This note was uploaded on 07/10/2011 for the course MIE 376 taught by Professor Daniel during the Spring '11 term at University of Toronto- Toronto.

Ask a homework question - tutors are online