04 - Industrial Engineering 634 Integer Programming Fall...

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

View Full Document Right Arrow Icon
Industrial Engineering 634 Fall 2011 Integer Programming Lecturer: Nelson Uhan Scribe: Isaac Tetzloff August 29, 2011 Lecture 4. The Simplex Method and LP Duality Let J be a set of row indices. With J , we let A J be the submatrix of A with rows in J , and we let b J be the subvector of b with components in J . Algorithm 1 (The Simplex Algorithm) . The Simplex Algorithm for solving a linear program (LP) takes in the following as input: A R m × n ,b R m ,c R n , and a vertex x of P , { x R n : Ax b } . After the Simplex Algorithm terminates the following output is given: a vertex x of P attaining max { cx : x P } or a vector w R n with Aw 0 and cw > 0 (i.e., the LP is unbounded). The process for the Simplex Algorithm is given by the following steps: 1. Find an initial basis by choosing a set of n row indices J such that A J is nonsingular and A J x = b J . 2. Compute the reduced costs by computing
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.

This note was uploaded on 02/14/2012 for the course IE 530 taught by Professor Ravindran during the Spring '97 term at Purdue.

Page1 / 2

04 - Industrial Engineering 634 Integer Programming Fall...

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