CS149-Notes-11-Bland

# CS149-Notes-11-Bland - 1 Chapter 1, Paragraph 4 Lecture...

This preview shows pages 1–3. Sign up to view the full content.

1 Chapter 1, Paragraph 4 – Lecture Notes Bland’s Anticycling Algorithm (Slide 9) What does it mean to choose B ( i ) minimal? Suppose we we have a tableau . . . 27 . . . 129 . . . 503 . . . . . . 0 . . . 0 . . . 1 . . . . . . 0 . . . 0 . . . 0 . . . . . . 0 . . . 1 . . . 0 . . . . . . 1 . . . 0 . . . 0 . . . What does B look like? B = (503 , 27 , 129) B ( i ) is minimal with i = 2 , B ( i ) = 27 Remember, λ = min b x B ( i ) - y B ( i ) | y B ( i ) < 0 B = min b ¯ b i ¯ a t i | ¯ a i t > 0 B An observation : consider the tableau . . . 27 129 . . . t 503 q . . . . . . 0 0 . . . 0 1 0 0 . . . 0 0 . . . 0 1 0 . . . 0 1 . . . 0 0 0 0 . . . 1 0 . . . 0 0 0 0 If we choose variable q to leave the basis, with the right-hand-side equal to zeroes, it implies that the element in nonbasic column t in the row where q contains a 1 is positive and all other elements are 0.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2 Assume there is a cycle among columns c 2 , c 4 , and q in our tableau: . . . c
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 11/03/2009 for the course CS CS 149 taught by Professor Meinolf during the Spring '09 term at Sanford-Brown College.

### Page1 / 4

CS149-Notes-11-Bland - 1 Chapter 1, Paragraph 4 Lecture...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online