X2 ≥ 3 X1, X2 ≥ 0 This linear programming model has: A) alternate optimal solution B) unbounded solution C) redundant constraint D) infeasible solution E) unique solution Answer: D Page Ref: 37 Topic: Special Situations in Solving Linear Programming Problems Difficulty: Easy 7) Consider the following linear programming model Max 2X1 + 3X2 Subject to: X1 + X2 X1 ≥ 2 X1, X2 0 This linear programming model has: A) redundant constraints B) infeasible solution C) alternate optimal solution D) unique solution E) unbounded solution Answer: E Page Ref: 39 Topic: Special Situations in Solving Linear Programming Problems Difficulty: Easy 8) Consider the following linear programming model Min 2X1 + 3X2 Subject to: X1 + X2 ≥ 4 X1 ≥ 2 X1, X2 0 This linear programming model has: A) unique optimal solution B) unbounded solution C) infeasible solution D) alternate optimal solution E) redundant constraints
3 Copyright (c) 2013 Pearson Education, Inc. publishing as Prentice Hall