This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: evidence for your answer. 1 3. Simplex Method, Does this ever end? (from Chvatal) Consider the following LP (P). max 10 x 157 x 29 x 324 x 4 . 5 x 15 . 5 x 22 . 5 x 3 + 9 x 4 ≤ . 5 x 11 . 5 x 2. 5 x 3 + x 4 ≤ x 1 ≤ 1 x 1 , x 2 , x 3 x 4 ≥ (a) Perform two iterations of the Simplex Method on (P) using the two rules below. Clearly show the details of each iteration. Also, for each tableau, clearly identify the basis B , the corresponding basic feasible solution, and the current objective function value. i. Choose as entering variable the nonbasic variable with the largest coeﬃcient in the zrow. ii. If two or more basic variables compete for leaving the basis, choose the candidate with the smallest subscript. (b) In the three tableaux, what has changed? (c) In the three tableaux, what has not changed? 2...
View
Full Document
 Winter '07
 S.Furino,B.Guenin
 Linear Programming, Optimization

Click to edit the document details