simplex - IEOR 162 NOTES SPRING 2007 1. The Algebra of the...

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

View Full Document Right Arrow Icon
IEOR 162 NOTES SPRING 2007 1. The Algebra of the Simplex Algorithm Consider the linear program (LP) max cx s.t. Ax = b x 0 in standard form, where A is an m × n –matrix ( m n ), b is an m –column vector, and c is an n –row vector. Without loss of generality, we may assume that rank ( A ) = m , since otherwise we can remove the linearly dependent rows of A without changing the feasible set of solutions. Let x = ( x B ,x N ) be a basic feasible solution of LP, i.e., A = ( A B ,A N ), where A B is an invertible m × m submatrix of A , x B = A - 1 B b 0 and x N = 0. So x i , i B are the basic variables and x i , i N are the nonbasic variables. Using the partitioning of the variables into B (basic) and N (nonbasic), we rewrite LP as max c B x B + c N x N st A B x B + A N x N = b x B ,x N 0 . Equivalently, solving for x B , we can rewrite LP as max c B A - 1 B b + ( c N - c B A - 1 B A N ) x N st x B = A - 1 B b - A - 1 B A N x N x B ,x N 0 . This form of the LP is called the
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 2

simplex - IEOR 162 NOTES SPRING 2007 1. The Algebra of the...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online