Test Bank for Practical Management Science 6th by Winston

Test Bank for Practical Management Science 6th by

Winston

To download the complete and accurate content document, go to:

https://testbankbell.com/download/test-bank-for-practical-management-science-6th-b
y-winston/

Visit TestBankBell.com to get complete for all chapters

Chapter 6 - Optimization Models with Integer Variables
1. In a model with 8 changing cells, all of which are constrained to be binary, the number of potentially feasible solutions
is:
a. 4
b. 8
c. 64
d. 256
ANSWER: d
POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

2. In a linear model, the target cell and constraints are ultimately:

a. a product of changing cells
b. a sum of products of changing cells
c. a product of constants and changing cells
d. a sum of products of constants and changing cells
ANSWER: d
POINTS: 1
DIFFICULTY: Moderate |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

3. Many inherently nonlinear problems can be transformed into linear models with the use of:
a. integer variables
b. integer constraints
c. binary variables
d. binary constraints
ANSWER: c
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
Copyright Cengage Learning. Powered by Cognero. Page 1
Chapter 6 - Optimization Models with Integer Variables
DATE MODIFIED: 10/21/2017 9:05 PM

4. Rounding the solution of a linear programming to the nearest integer values provides an:
a. integer solution that is optimal
b. integer solution that is not optimal
c. integer solution that might be optimal
d. infeasible solution
ANSWER: c
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

5. The branching part of the branch and bound algorithm that Solver uses to solve integer programming models means
that the algorithm:
a. creates subsets of solutions through which to search
b. searches through only a limited set of feasible integer solutions
c. identifies an incumbent solution which is optimal
d. uses a decision tree to find the optimal solution
ANSWER: a
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

6. An algorithm which uses implicit enumeration:

a. is impractical
b. examines all possible solutions
c. does not guarantee that some of the solutions not examined could be optimal
d. excludes many possible solutions that guaranteed to be suboptimal
ANSWER: d
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
Copyright Cengage Learning. Powered by Cognero. Page 2
Chapter 6 - Optimization Models with Integer Variables
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

7. The branch and bound algorithm uses:

a. lower bounds
b. upper bounds
c. both upper and lower bounds
d. neither upper or lower bounds
ANSWER: c
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

8. The default integer optimality setting in Solver is:

a. 0.1%
b. 0.5%
c. 1%
d. 5%
ANSWER: d
POINTS: 1
DIFFICULTY: Easy |Bloom's Knowledge
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - The Solver Integer Optimality Setting
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

9. Any integer program involving 0 − 1 variables with ____ constraint(s) is called a knapsack problem.
a. three
b. two
c. one
d. zero
ANSWER: c
POINTS: 1
DIFFICULTY: Easy |Bloom's Knowledge
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
Copyright Cengage Learning. Powered by Cognero. Page 3
Chapter 6 - Optimization Models with Integer Variables
TOPICS: 6.3 Capital Budgeting Models - Modeling Issues
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

10. The binary variables in the fixed cost models correspond to:
a. the number of units or products produced
b. the total profit
c. the amount of labor hours
d. a process for which a fixed cost occurs
ANSWER: d
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: Multiple Choice
HAS VARIABLES: False
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

11. Optimization software, including Solver, typically has more difficulty solving an integer programming problem,
relative to a linear programming problem.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

12. Solver may be unable to solve some integer programming problems, even when they have an optimal solution.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.1 Introduction
OTHER: BUSPROG - Analytic |DISC - Integer Models
Copyright Cengage Learning. Powered by Cognero. Page 4
Chapter 6 - Optimization Models with Integer Variables
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

13. Complete enumeration of all possible solutions in many integer programming problems is impractical.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

14. During the solution of a maximization problem with the branch and bound algorithm, an incumbent solution
represents an upper bound on the solution.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

15. The higher the upper bound produced for a maximization problem in the branch and bound solution process, the faster
the algorithm will be.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - Branch and Bound Algorithm
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

16. If Solver fails to find an optimal solution to an integer programming problem, we might be able to find a near optimal
Copyright Cengage Learning. Powered by Cognero. Page 5
Chapter 6 - Optimization Models with Integer Variables
solution by specifying a smaller number for the integer optimality setting.
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - The Solver Integer Optimality Setting
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

17. The LP relaxation of an integer programming (IP) problem is typically easy to solve and provides a bound for the IP
model.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Easy |Bloom's Comprehension
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.2 Overview of Optimization with Integer Variables - The Solver Integer Optimality Setting
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

18. Problems with a fixed cost that is incurred only if an activity is undertaken at a positive level are inherently nonlinear.
a. True
b. False
ANSWER: True
POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

19. Fixed costs imply that the divisibility assumption of linear models no longer holds.
a. True
b. False
ANSWER: False

Copyright Cengage Learning. Powered by Cognero. Page 6

Chapter 6 - Optimization Models with Integer Variables
POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

20. In a set-covering model, each member of a given set (set 1) must be "covered" by all members of another set (set 2).
a. True
b. False
ANSWER: False
POINTS: 1
DIFFICULTY: Moderate |Bloom's Application
QUESTION TYPE: True / False
HAS VARIABLES: False
TOPICS: 6.5 Set-Covering and Location-Assignment Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

Exhibit 6-1
A recent college graduate is planning to move cross country from her college town to the city where her first job is
located. She has rented a truck that can haul up to 1100 cubic feet of furniture. The volume and value of each item she is
considering moving on the truck are given below.

21. Refer to Exhibit 6-1. This problem is an example of what type of integer programming model?
ANSWER: This is an integer programming model requiring binary variables (to indicate which items the
graduate will move) and a single constraint (the capacity of the moving truck), therefore it is a
knapsack problem.
POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-1
TOPICS: 6.3 Capital Budgeting Models - Modeling Issues
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

Copyright Cengage Learning. Powered by Cognero. Page 7

Chapter 6 - Optimization Models with Integer Variables
22. Refer to Exhibit 6-1. Which items should she take with her to her new home? What is the value of these items?
ANSWER: The solved knapsack model is shown below. She should take the dining set, soft and TV, which have
a combined total value of $800.

POINTS: 1
DIFFICULTY: Moderate |Bloom's Application
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-1
TOPICS: 6.3 Capital Budgeting Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

23. Refer to Exhibit 6-1. Suppose she can save $400 by renting a smaller truck, which has only 800 cubic feed of capacity.
Would she be better off with the smaller truck?
ANSWER: The revised knapsack model is shown below. In this case, she would take only the dining set and the
TV, which have a combined total value of $600. This is $200 less value than before, but she would
save twice that with the smaller truck.

POINTS: 1

Copyright Cengage Learning. Powered by Cognero. Page 8

Chapter 6 - Optimization Models with Integer Variables
DIFFICULTY: Moderate |Bloom's Application
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-1
TOPICS: 6.3 Capital Budgeting Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

Exhibit 6-2
Sinclair Plastics operates two chemical plants which produce polyethylene; the Ohio Valley plant which can produce up to
10,000 tons per month and the Lakeview plant which can produce up to 7,000 tons per month. Sinclair sells its
polyethylene to three different auto manufacturing plants, Grand Rapids (demand = 3000 tons per month), Blue Ridge
(demand = 5000 tons per month), and Sunset (demand = 4000 tons per month). The variable unit cost of shipping a ton is
$1 per mile. The number of miles between the respective plants is shown in the table below:

Grand Rapids Blue Ridge Sunset

Ohio Valley 50 40 100
Lakeview 60 50 75
In addition to the variable unit costs of shipping, Sinclair incurs a fixed handling cost (of pickup and delivery) for any
shipping routes it uses. These costs are discounted for longer routes, as shown below:

24. Refer to Exhibit 6-2. This problem is an example of what type of integer programming model?
ANSWER: This problem requires an integer programming model with binary variables to indicate when the
fixed costs are incurred, therefore it is a fixed cost problem.
POINTS: 1
DIFFICULTY: Moderate |Bloom's Comprehension
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-2
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

25. Refer to Exhibit 6-2. What problem will occur if we use an IF statement to model the fixed handling costs?
ANSWER: The success of a model using IF statements will depend on the starting values used, and may not
always provide the optimal solution.
POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
Copyright Cengage Learning. Powered by Cognero. Page 9
Chapter 6 - Optimization Models with Integer Variables
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-2
TOPICS: 6.4 Fixed-Cost Models - A Model with IF Functions
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

26. Refer to Exhibit 6-2. What is Sinclair's optimal shipping plan? What is the total cost in that case?
ANSWER: The solved model is shown below. Sinclair will ship from Ohio Valley to Blue Ridge, and from
Lakeview to Grand Rapids and Sunset. The total cost is $780,000.

POINTS: 1
DIFFICULTY: Challenging |Bloom's Application
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-2
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

27. Refer to Exhibit 6-2. Suppose the shipping capacity for all routes is 3000 tons per month. What is Sinclair's optimal
shipping plan in that case? What is the total cost in that case?
ANSWER: The solved model is shown below. Sinclair will be forced to use all but the Lakeview to Grand
Rapids route, which increases the total cost substantially to $895,000.

Copyright Cengage Learning. Powered by Cognero. Page 10

Chapter 6 - Optimization Models with Integer Variables

POINTS: 1
DIFFICULTY: Easy |Bloom's Application
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-2
TOPICS: 6.4 Fixed-Cost Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

Exhibit 6-3
PharmaCo wants to determine how to deploy sales representatives across its Western U.S. region to support a new drug
for obesity. Sales representatives will be located in a "home city", which they serve, in addition to cities with feasible
commuting distance, with the objective that all cities must be served by at least one sales representative. The feasible
connections between each city in the region are listed below (1 indicates a feasible connection):

28. Refer to Exhibit 6-3. This problem is an example of what type of integer programming model?
Copyright Cengage Learning. Powered by Cognero. Page 11
Chapter 6 - Optimization Models with Integer Variables
ANSWER: This problem requires that every member of a given set (the cities) to be covered by an acceptable
(within commuting distance) member of another set (the sales representative home cities), so this is a
set covering model.
POINTS: 1
DIFFICULTY: Easy |Bloom's Analysis
QUESTION TYPE: Subjective Short Answer
HAS VARIABLES: False
PREFACE NAME: Exhibit 06-3
TOPICS: 6.5 Set-Covering and Location-Assignment Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATED: 5/17/2017 3:49 PM
DATE MODIFIED: 10/21/2017 9:05 PM

29. Refer to Exhibit 6-3. Formulate an integer programming model to identify a feasible deployment plan to the sales
representatives. What is the minimum number of representatives that can cover this region? What are their home cities?
ANSWER: PharmaCo will need to deploy 2 sales representatives. One feasible solution is for their home cities to be
Phoenix and Seattle.

POINTS: 1
DIFFICULTY: Challenging |Bloom's Application
QUESTION TYP Subjective Short Answer
E:
HAS VARIABLE False
S:
PREFACE NAM Exhibit 06-3
E:
TOPICS: 6.5 Set-Covering and Location-Assignment Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
Copyright Cengage Learning. Powered by Cognero. Page 12
Test Bank for Practical Management Science 6th by Winston

Chapter 6 - Optimization Models with Integer Variables

DATE CREATE 5/17/2017 3:49 PM
D:
DATE MODIFIE10/21/2017 9:05 PM
D:

30. Refer to Exhibit 6-3. Suppose PharmaCo wants to have a backup for each city. What is the minimum number of
representatives that can cover this region in that case? What are their home cities?
ANSWER: PharmaCo would need to deploy 3 additional sales representatives (five total). One feasible solution is
for their home cities to be in Albuquerque, San Diego, Los Angeles, Seattle and Las Vegas.

POINTS: 1
DIFFICULTY: Moderate |Bloom's Analysis
QUESTION TYP Subjective Short Answer
E:
HAS VARIABLE False
S:
PREFACE NAM Exhibit 06-3
E:
TOPICS: 6.5 Set-Covering and Location-Assignment Models
OTHER: BUSPROG - Analytic |DISC - Integer Models
DATE CREATE 5/17/2017 3:49 PM
D:
DATE MODIFI 10/21/2017 9:05 PM
ED:

Copyright Cengage Learning. Powered by Cognero. Page 13

Visit TestBankBell.com to get complete for all chapters