hours would most likely constitute a decision variable rather than a constraint. Answer: FALSE Page Ref: 24 Formulating a Linear Programming Model Difficulty: Easy 30) When Solver, the parameter is typically associated with the objective function. Changing Cells Answer: FALSE Page Ref: 45 Topic: Setting Up and Solving Linear Programming Problems Using Excel's Solver Difficulty: Easy 31) The simplex method is an algebraic solution procedure for a linear programming problem. Answer: TRUE Page Ref: 52 Topic: Algebraic Solution Procedures for Linear Programming Problems Difficulty: Easy 32) Karmarkar's method is synonymous with the corner point method. Answer: Page Ref: 52 Topic: Algebraic Solution Procedures for Linear Programming Problems Difficulty: Moderate 2.2 Excel Problems 1) Consider the following linear programming problem. Maximize 6X1 + 4X2 Subject to: X1 + 2X2 16 ≤ 3X1 + 2X2 24 ≤ X1 2 ≥ X1, X2 0 ≥ Use Solver to find the optimal values of X1 and X2. Answer: 2) Consider the following linear programming problem. Maximize 5X1 + 3X2 Subject to: X1 + X2 20 ≤ X1 5 ≥
hours would most likely constitute a decision variable rather than a constraint. Answer: FALSE Page Ref: 24 Formulating a Linear Programming Model Difficulty: Easy 30) When Solver, the parameter Changing Cells is typically associated with the objective function. Answer: FALSE Page Ref: 45 Topic: Setting Up and Solving Linear Programming Problems Using Excel's Solver Difficulty: Easy 31) The simplex method is an algebraic solution procedure for a linear programming problem. Answer: TRUE Page Ref: 52 Topic: Algebraic Solution Procedures for Linear Programming Problems Difficulty: Easy 32) Karmarkar's method is synonymous with the corner point method. Answer: Page Ref: 52 Topic: Algebraic Solution Procedures for Linear Programming Problems Difficulty: Moderate 2.2 Excel Problems 1) Consider the following linear programming problem. Maximize 6X1 + 4X2 Subject to: X1 + 2X2 ≤ 16 3X1 + 2X2 ≤ 24 X1 ≥ 2 X1, X2 ≥ 0 Use Solver to find the optimal values of X1 and X2. Answer: 2) Consider the following linear programming problem. Maximize 5X1 + 3X2 Subject to: X1 + X2 ≤ 20 X1 ≥ 5
Test-Bank-for-Managerial-Decision-Modeling-with-Spreadsheets-3E-3rd-Edition.docx