# sec12_Notes - 12 Termination In order for the simplex...

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

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: 12 Termination In order for the simplex method to be a reliable algorithm, we must be sure that, starting from a feasible tableau, it terminates after a finite number of iterations. In this section we shall see that the smallest subscript rule ensures termination. We need one last ingredient. We consider the standard equality-form linear program maximize c T x = z subject to Ax = b x , where A is an m-by- n matrix. Proposition 12.1 (uniqueness of tableau) There is exactly one tableau corresponding to each (ordered) basis. Proof Let B be a basis, and let N be a list of the indices not in B . By definition, the basis matrix A B with columns from A indexed by B is invertible. Recall from Section 5 that we also write A N for the matrix with columns from A indexed by N . Analogously, we write x B , x N for vectors with entries from x indexed by B and N respectively, with similar definitions for the vectors c B and c N . Using this notation, we can rewrite the system of equations defining the linear program as...
View Full Document

## This note was uploaded on 02/20/2009 for the course ORIE 3300 taught by Professor Todd during the Fall '08 term at Cornell University (Engineering School).

### Page1 / 3

sec12_Notes - 12 Termination In order for the simplex...

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

View Full Document
Ask a homework question - tutors are online