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
Unformatted text preview: 13 Fundamental theorems Now that we have made the simplex method a reliable finite algorithm, we can use it to deduce some striking properties of general linear programs. We start by asking when a linear program in standard equality form, ( * ) maximize c T x subject to Ax = b x , has a basic feasible solution. Theorem 13.1 (existence of basic feasible solutions) The linear pro gram ( * ) has a basic feasible solution if and only if it is feasible and the columns of the matrix A span. Proof If the linear program ( * ) has a basic feasible solution, then it is feasible, and furthermore, since the corresponding basis matrix is invertible, the columns of A must certainly span. Conversely, suppose ( * ) is feasible and the columns of A span. Applying Phase 1 of the simplex method using the smallest subscript rule, we must terminate with optimal value zero, because ( * ) is feasible. Furthermore, in the body of the final tableau, no row of coefficients of the original variables in (...
View
Full
Document
This note was uploaded on 01/09/2009 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