Unformatted text preview: maximize 3 x 3 subject to x 2 + x 3 ≤ 4x 2 + x 3 ≤ x 1 + x 3 ≤ 4x 1 + x 3 ≤ 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 threedimensional 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 note was uploaded on 09/29/2011 for the course ORIE 5300 taught by Professor Todd during the Fall '08 term at Cornell.
 Fall '08
 TODD

Click to edit the document details