CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
1. Which of the following does not represent a broad class of applications of linear
programming models?
a. Blending models
b. Financial portfolio models
c. Logistics models
d. Set covering models
e. Forecasting models
ANS: E PTS: 1 MSC: AACSB: Analytic
2. Many organizations must determine how to schedule employees to provide adequate
service. If we assume that an organization faces the same situation each week, this is referred
to as
a. static scheduling problem
b. dynamic scheduling problem
c. transportation scheduling problem
d. All of these options
ANS: A PTS: 1 MSC: AACSB: Analytic
3. Workforce scheduling problems are often integer programming models, which means that they
have:
a. an integer objective function
b. integer decision variables
c. integer constraints
d. all of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
4. A common characteristic of integer programming models is that they:
,CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
a. are easy to solve graphically
b. produce the same answer and standard linear programming models
c. often produce multiple optimal solutions
d. all of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
5. Which of the following is true regarding multiple optimal solutions?
a. All solutions have the same values for the decision variables
b. All solutions have the same value for the objective function
c. All solutions have the same shadow prices
d. All of these options
ANS: B PTS: 1 MSC: AACSB: Analytic
6. Many organizations must determine how to schedule employees to provide adequate
service. If we assume that an organization faces the same situation each week, this is referred
to as
a. static scheduling problem
b. dynamic scheduling problem
c. transportation scheduling problem
d. All of these options
,CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
ANS: A PTS: 1 MSC: AACSB: Analytic
7. Rounding the solution of a linear programming to the nearest integer values provides a(n)
a. integer solution that is optimal
b. integer solution that may be neither feasible nor optimal
c. feasible solution that is not necessarily optimal
d. infeasible solution
ANS: B PTS: 1 MSC: AACSB: Analytic
8. Which of the following statements are false?
a. Solver does not offer a sensitivity report for models with integer constraints
b. Solver’s sensitivity report is not suited for questions about multiple input changes
c. Solver’s sensitivity report is used primarily for questions about one-at-a time
changes to input
d. None of these options
ANS: D PTS: 1 MSC: AACSB: Analytic
9. If refers to the number of hours employee works in week , then to indicate that the
number of working hours of 4 employees in week 3 should not exceed 160 hours, we must
have a constraint of the form
a.
b.
c.
d.
ANS: B PTS: 1 MSC: AACSB: Analytic
10. Which of the following statements is a type of constraint that is often required in blending
problems?
a. Integer constraint
, CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
b. Binary constraint
c. Quality constraint
d. None of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
11. The constraints in a blending problem can be specified in a valid way and still lead to
which of the following problems?
a. Unboundedness
b. Infeasibility
c. Nonlinearity
d. None of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
12. To specify that must be at most 75% of the blend of , , and , we must have a
constraint of the form
a.
b.
c.
VERIFIED ANSWERS RATED A+
1. Which of the following does not represent a broad class of applications of linear
programming models?
a. Blending models
b. Financial portfolio models
c. Logistics models
d. Set covering models
e. Forecasting models
ANS: E PTS: 1 MSC: AACSB: Analytic
2. Many organizations must determine how to schedule employees to provide adequate
service. If we assume that an organization faces the same situation each week, this is referred
to as
a. static scheduling problem
b. dynamic scheduling problem
c. transportation scheduling problem
d. All of these options
ANS: A PTS: 1 MSC: AACSB: Analytic
3. Workforce scheduling problems are often integer programming models, which means that they
have:
a. an integer objective function
b. integer decision variables
c. integer constraints
d. all of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
4. A common characteristic of integer programming models is that they:
,CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
a. are easy to solve graphically
b. produce the same answer and standard linear programming models
c. often produce multiple optimal solutions
d. all of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
5. Which of the following is true regarding multiple optimal solutions?
a. All solutions have the same values for the decision variables
b. All solutions have the same value for the objective function
c. All solutions have the same shadow prices
d. All of these options
ANS: B PTS: 1 MSC: AACSB: Analytic
6. Many organizations must determine how to schedule employees to provide adequate
service. If we assume that an organization faces the same situation each week, this is referred
to as
a. static scheduling problem
b. dynamic scheduling problem
c. transportation scheduling problem
d. All of these options
,CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
ANS: A PTS: 1 MSC: AACSB: Analytic
7. Rounding the solution of a linear programming to the nearest integer values provides a(n)
a. integer solution that is optimal
b. integer solution that may be neither feasible nor optimal
c. feasible solution that is not necessarily optimal
d. infeasible solution
ANS: B PTS: 1 MSC: AACSB: Analytic
8. Which of the following statements are false?
a. Solver does not offer a sensitivity report for models with integer constraints
b. Solver’s sensitivity report is not suited for questions about multiple input changes
c. Solver’s sensitivity report is used primarily for questions about one-at-a time
changes to input
d. None of these options
ANS: D PTS: 1 MSC: AACSB: Analytic
9. If refers to the number of hours employee works in week , then to indicate that the
number of working hours of 4 employees in week 3 should not exceed 160 hours, we must
have a constraint of the form
a.
b.
c.
d.
ANS: B PTS: 1 MSC: AACSB: Analytic
10. Which of the following statements is a type of constraint that is often required in blending
problems?
a. Integer constraint
, CHAPTER 14: OPTIMIZATION MODELING: APPLICATIONS WITH
VERIFIED ANSWERS RATED A+
b. Binary constraint
c. Quality constraint
d. None of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
11. The constraints in a blending problem can be specified in a valid way and still lead to
which of the following problems?
a. Unboundedness
b. Infeasibility
c. Nonlinearity
d. None of these options
ANS: C PTS: 1 MSC: AACSB: Analytic
12. To specify that must be at most 75% of the blend of , , and , we must have a
constraint of the form
a.
b.
c.
