Unformatted text preview: choice between possible leaving variables. maximize x 3 subject tox 1 + x 3 ≤ x 1 + x 3 ≤ 4x 2 + x 3 ≤ x 2 + x 3 ≤ 4 x 1 , x 2 , x 3 ≥ . (b) At which iterations was the basic feasible solution degenerate? (c) Which of the pivots you performed were degenerate? (d) Sketch a threedimensional picture of the feasible region. (e) Which, if any, of the four ﬁrst constraints is “redundant”? In other words, which, if any, of these constraints could you delete without changing the feasible region? 1...
View
Full Document
 '08
 TODD
 Linear Programming, Optimization, Introduce slack variables, smallest subscript rule, initial basic variables

Click to edit the document details