INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
1. The reduced cost (shadow price) for a positive decision variable is
0. Answer: TRUE
Diff: 2 Page Ref: 90
Main Heading: Computer Solution
Key words: shadow price, sensitivity analysis
2. When the right-hand sides of 2 constraints are both increased by 1 unit, the value of
the objective function will be adjusted by the sum of the constraints' prices.
Answer: FALSE
Diff: 3 Page Ref: 90
Main Heading: Computer Solution
Key words: sensitive analysis, right-hand-side
3. When a linear programming problem is solved using a computer package decision variables
will always be integer and therefore decision variable values never need to be rounded.
Answer: FALSE
Diff: 1
Main Heading: Computer Solution
Key words: computer solution
4. Sensitivity ranges can be computed only for the right hand sides of
constraints. Answer: FALSE
Diff: 1 Page Ref: 90
Main Heading: Computer Solution
Key words: computer solution
5. Sensitivity analysis determines how a change in a parameter affects the optimal
solution. Answer: TRUE
Diff: 2 Page Ref: 79
1
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis
6. The sensitivity range for an objective function coefficient is the range of values over
which the current optimal solution point (product mix) will remain optimal.
Answer: TRUE
Diff: 2 Page Ref: 81
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
2
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
7. The sensitivity range for an objective function coefficient is the range of values over
which the profit does not change.
Answer: FALSE
Diff: 2 Page Ref: 81
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
8. The sensitivity range for a constraint quantity value is the range over which the shadow
price is valid.
Answer: TRUE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
9. If we change the constraint quantity to a value outside the sensitivity range for that
constraint quantity, the shadow price will change.
Answer: TRUE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, shadow price
10. The sensitivity range for a constraint quantity value is the range over which the
optimal values of the decision variables do not change.
Answer: FALSE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
11. Linear programming problems are restricted to decisions in a single time
period. Answer: FALSE
Diff: 2 Page Ref: 30
Main Heading: Sensitivity Analysis
3
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
Key words: linear programming problems, formulation
12. A maximization problem may be characterized by all greater than or equal to
constraints. Answer: FALSE
Diff: 2 Page Ref: 30
Main Heading: Sensitivity Analysis
Key words: linear programming, formulation
4
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
1. The reduced cost (shadow price) for a positive decision variable is
0. Answer: TRUE
Diff: 2 Page Ref: 90
Main Heading: Computer Solution
Key words: shadow price, sensitivity analysis
2. When the right-hand sides of 2 constraints are both increased by 1 unit, the value of
the objective function will be adjusted by the sum of the constraints' prices.
Answer: FALSE
Diff: 3 Page Ref: 90
Main Heading: Computer Solution
Key words: sensitive analysis, right-hand-side
3. When a linear programming problem is solved using a computer package decision variables
will always be integer and therefore decision variable values never need to be rounded.
Answer: FALSE
Diff: 1
Main Heading: Computer Solution
Key words: computer solution
4. Sensitivity ranges can be computed only for the right hand sides of
constraints. Answer: FALSE
Diff: 1 Page Ref: 90
Main Heading: Computer Solution
Key words: computer solution
5. Sensitivity analysis determines how a change in a parameter affects the optimal
solution. Answer: TRUE
Diff: 2 Page Ref: 79
1
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis
6. The sensitivity range for an objective function coefficient is the range of values over
which the current optimal solution point (product mix) will remain optimal.
Answer: TRUE
Diff: 2 Page Ref: 81
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
2
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
7. The sensitivity range for an objective function coefficient is the range of values over
which the profit does not change.
Answer: FALSE
Diff: 2 Page Ref: 81
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
8. The sensitivity range for a constraint quantity value is the range over which the shadow
price is valid.
Answer: TRUE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
9. If we change the constraint quantity to a value outside the sensitivity range for that
constraint quantity, the shadow price will change.
Answer: TRUE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, shadow price
10. The sensitivity range for a constraint quantity value is the range over which the
optimal values of the decision variables do not change.
Answer: FALSE
Diff: 2 Page Ref: 86
Main Heading: Sensitivity Analysis
Key words: sensitivity analysis, objective coefficients
11. Linear programming problems are restricted to decisions in a single time
period. Answer: FALSE
Diff: 2 Page Ref: 30
Main Heading: Sensitivity Analysis
3
, INTRODUCTION TO MANAGEMENT SCIENCE, 10E (TAYLOR)
CHAPTER 3 LINEAR PROGRAMMING: COMPUTER SOLUTION
AND SENSITIVITY ANALYSIS RATED A+
Key words: linear programming problems, formulation
12. A maximization problem may be characterized by all greater than or equal to
constraints. Answer: FALSE
Diff: 2 Page Ref: 30
Main Heading: Sensitivity Analysis
Key words: linear programming, formulation
4
