This preview shows pages 1–3. 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: ISE 536Fall03: Linear Programming and Extensions September 22, 2003 Lecture 7: Simplex Method, The Tableau Lecturer: Fernando Ord onez 1 Outline of Algorithm The makings of the Simplex algorithm, and formulas to keep in mind: Find a BFS Ax = b x A = [ BN ] x = ( x B , x N ) c = ( c B , c N ) x B = B 1 b x N = 0 . Find a direction d that is feasible and improves the cost ( d N ) j = 1 j N ( d N ) i = 0 i N, i 6 = j d B = B 1 A j b = Bx B + ( Bd B + Nd N ) d B = B 1 A j and c t ( x + d ) < c t x c t d < 0 which means that the reduced cost for variable j c j := ( c N ) j c t B B 1 A j < Move as much as possible in that direction, i.e. need to enforce that x + d 2 The Tableau Recall the example min c 1 x 1 + c 2 x 2 + c 3 x 3 + c 4 x 4 + c 5 x 5 s . t . x 1 + x 2 + x 3 + x 4 = 5 x 2 x 3 + x 5 = 3 2 x 1 + x 2 = 4 1 2.1 Graphically: 2.2 Obtain a BFS 2.3 Find Basic Directions and Reduced Costs 2.4 Tableau The tableau is a simple way of being organized, we represent all coefficients of interest in a...
View
Full
Document
This note was uploaded on 02/13/2012 for the course ISE 536 taught by Professor Yy during the Spring '05 term at South Carolina.
 Spring '05
 YY

Click to edit the document details