Unformatted text preview: subscript, and use the same rule when the method allows you a choice between possible leaving variables. maximize 3 x 3 subject to-x 2 + x 3 ≤ x 2 + x 3 ≤ 2-x 1 + x 3 ≤ x 1 + x 3 ≤ 2 x 1 , x 2 , x 3 ≥ . (b) At which iterations was the basic feasible solution degenerate? (c) Which of the pivots you performed are degenerate? (d) Sketch a three-dimensional picture of the feasible region. (e) Which, if any, of the four ≤ constraints is “redundant”? In other words, which, if any, constraint could you delete without changing the feasible region? 1...
View Full Document
This homework help was uploaded on 02/20/2009 for the course ORIE 3300 taught by Professor Todd during the Fall '08 term at Cornell.
- Fall '08