This preview shows page 1. Sign up to view the full content.
Unformatted text preview: MIE376 Mathematical Programming Lecture Notes Daniel Frances 2011 3 ( ) ( ) ( ) 2 1 2 1 1 1 3 1 1 1 1 = = T N T B c N B c and x2 is the entering variable Departing Variable Recall the original constraints Bx B + Nx N = b Recall that in the substitution method we were expressing the basic variables in terms of the non-basic variables This can be done simply using the matrix notation as we did before x B =B-1 b- B-1 Nx N . or using our example in the first iteration 2 1 2 1 4 3 1 3 1 1 7 16 1 1 3 1 7 16 x x x x x x = = As with the substitution method, as x 2 grows many basic variables may decrease. The departing variable is the basic variable that reaches zero first. Clearly we need to compare 16/3 and 7/1; the smallest ratio with a basic variable that reaches zero first....
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.
- Spring '11