# L14 - CO350 Linear Programming Chapter 6 The Simplex Method...

This preview shows pages 1–6. Sign up to view the full content.

CO350 Linear Programming Chapter 6: The Simplex Method 3rd June 2005

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

View Full Document
Chapter 6: The Simplex Method 1 Recap Suppose A is an m -by- n matrix with rank m . ( P ) max. c T x s.t. Ax = b x 0 On Wednesday, we learned if ( P ) has an optimal solution, then it has an optimal solution that is basic. the motivation for simplex method: we search for an optimal solution one bfs at a time. how to obtain the basic solution determined by a given basis, while preserving the data of the LP.
Chapter 6: The Simplex Method 2 Bases and Tableaux Suppose A is m -by- n with rank m . ( P ) max. ( z =) c T x s.t. Ax = b x 0 (Defn ) Tableau A tableau for ( P ) corresponding to a basis B is the system of equations of the form z - j N ¯ c j x j = ¯ v x i + j N ¯ a ij x j = ¯ b i ( i B ) derived by applying elementary row operations to z - c T x = 0 Ax = b Example ( B = { 1 , 2 , 3 } ) z + 8 / 3 x 4 - 1 / 3 x 5 = 23 x 3 - 5 / 3 x 4 + 4 / 3 x 5 = 4 x 1 + 1 / 3 x 4 + 1 / 3 x 5 = 4 x 2 + 1 / 3 x 4 - 2 / 3 x 5 = 1 ¯ c 4 = - 8 / 3 ¯ c 5 = 1 / 3 ¯ v = 23 ¯ a 34 = - 5 / 3 ¯ a 25 = - 2 / 3 ¯ b 2 = 1 z -row -→ x i -row -→ ( z -row) ( x 3 -row) ( x 1 -row) ( x 2 -row)

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

View Full Document
Chapter 6: The Simplex Method 3 A tableau has a wealth of information (Pg 71) Tableau corresponding to B = { 1 , 2 , 3 } : z + 8 / 3 x 4 - 1 / 3 x 5 = 23 x 3 - 5 / 3 x 4 + 4 / 3 x 5 = 4 x 1 + 1 / 3 x 4 + 1 / 3 x 5 = 4 x 2 + 1 / 3 x 4 - 2 / 3 x 5 = 1 1. The basic solution determined by B = { 1 , 2 , 3 } is x * = [4 , 1 , 4 , 0 , 0] T In general, the basic solution determined by B is x * i = ¯ b i for i B x * j = 0 for j N The solution is a bfs if and only if ¯ b i 0 for all i B . In this case, we say that the tableau is feasible , and B is a feasible basis . E.g., B = { 1 , 2 , 3 } is feasible but B = { 2 , 3 , 5 } is not feasible. 2. The objective value of the basic solution determined by B = { 1 , 2 , 3 } is z = ¯ v = 23 In general, the objective value is given by ¯ v .
Chapter 6: The Simplex Method 4 A tableau has a wealth of information (cont’d) Tableau corresponding to B = { 1 , 2 , 3 } : z + 8 / 3 x 4 - 1 / 3 x 5 = 23 x 3 - 5 / 3 x 4 + 4 / 3 x 5 = 4 x 1 + 1 / 3 x 4 + 1 / 3 x 5 = 4 x 2 + 1 / 3 x 4 - 2 / 3 x 5 = 1 3. When we increase x 5 from 0 while keeping the other nonbasic variable x 4 at 0 , we see that the term - 1 / 3 x 5 in the z -row decreases .

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern