This preview shows pages 1–5. 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: x s from among the eligible to enter variables, say that basic variable x B i is eligible to leave if a is > 0, and b i / a is = min { b k / a ks : a ks > } . Blands Least Index Rule: (CS) Column Selection: select x s , the variable eligible to enter variable having minimum index: s = min { j : c j > } . (RS) Row Selection: select x B r , the variable eligible to leave variable having minimum index: a rs > , b r / a rs = min { b i / a is : a is > } , and { B r = min { B i : a is > 0, and b i / a is = min { b k / a ks : a ks > }} . Theorem : The simplex method with the least index rule terminates after Fnitely many pivots. This theorem implies the strong duality theorem....
View
Full
Document
This note was uploaded on 03/30/2008 for the course ORIE 320 taught by Professor Bland during the Fall '07 term at Cornell University (Engineering School).
 Fall '07
 BLAND

Click to edit the document details