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 tox 2 + x 3 ≤ x 2 + x 3 ≤ 2x 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 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
 Fall '08
 TODD
 Linear Programming, Optimization, basic feasible solution, Introduce slack variables, smallest subscript rule

Click to edit the document details