This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Math 171A: Linear Programming Lecture 17 Degenerate Constraints and the Simplex Method Philip E. Gill c 2011 http://ccom.ucsd.edu/~peg/math171a Monday, February 14th, 2011 Recap: the simplex method One step moves from a vertex to an adjacent vertex . Each step requires the solution of two sets of equations: A T k k = c and A k p k = e s where A k is the nonsingular workingset matrix. Given a nonsingular A , all subsequent A k are nonsingular. Now we focus on what can happen at a degenerate vertex . UCSD Center for Computational Mathematics Slide 2/41, Monday, February 14th, 2011 Example: minimize 2 x 1 + x 2 subject to the constraints: constraint #1: x 1 + x 2 1 constraint #2: x 2 constraint #3: x 1 constraint #4: x 1  2 constraint #5: x 1 + 2 x 2  2 Written in the form min c T x subject to Ax b , we get c = 2 1 ! , A = 1 1 1 1 1 1 2 , b = 1 2 1 UCSD Center for Computational Mathematics Slide 3/41, Monday, February 14th, 2011 x 1 x 2 x * #3 #1 #2 #5 #4 x Execute the steps of the simplex method, starting at x = 1 At x , we have A ( x ) = { 1 , 2 , 5 } , so that if A = 1 1 1 1 1 1 2 , then A a = 1 1 0 1 1 2 If we choose W = { 2 , 5 } , then A = 0 1 1 2 ! , b = 1 ! UCSD Center for Computational Mathematics Slide 5/41, Monday, February 14th, 2011 STEP 1: Check for optimality: A T = c 0 1 1 2 ! = 2 1 ! = 3 2 ! s = 1 W = { w 1 , w 2 } = { 2 ws =2 , 5 } [ ] 1 = 3 is associated with constraint #2, i.e., x 2 0. UCSD Center for Computational Mathematics Slide 6/41, Monday, February 14th, 2011 STEP 2: Compute the search direction: A p = e 1 0 1 1 2 ! p = 1 ! p = 2 1 ! UCSD Center for Computational Mathematics Slide 7/41, Monday, February 14th, 2011 STEP 3: Take a step: Find the constraint residuals and decreasing constraints: r = Ax b = 1 1 1 1 1 1 2 1 ! 1 2 1 = 1 1 Ap = 1 1 1 1 1 1 2  2 1 ! =  1 1 2 2 UCSD Center for Computational Mathematics Slide 8/41, Monday, February 14th, 2011 STEP 3: (continued) Take a step: r = 1 1 , Ap =  1 1 2 2 1 = [ r ] 1 [ Ap ] 1 = ( 1) = 0 3 = [ r ] 3 [ Ap ] 3 = 1 ( 2) = 1 2 2 = 4 = 5 = + UCSD Center for Computational Mathematics Slide 9/41, Monday, February 14th, 2011 = min { 1 , 2 , 3 , 4 , 5 } = min { , + , 1 2 , + , + } = 1 = 0 In this case:...
View Full
Document
 Spring '08
 staff
 Linear Programming, Equations, Sets

Click to edit the document details