Quantitative Analysis for Management, 13e (Render et al.

)
Chapter 9 Transportation, Assignment, and Network Models

1) The points on the network are referred to as nodes.

Answer: TRUE
Diff: Moderate
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

2) Lines connecting nodes on a network are called links.

Answer: FALSE
Diff: Moderate
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

3) Transportation models may be used when a firm is trying to decide where to locate a new
facility.
Answer: TRUE
Diff: Moderate
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

4) A typical transportation problem may ask the question, "How many of X should be shipped to
point E from source A?"
Answer: TRUE
Diff: Easy
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

5) The objective of a transportation problem solution is to schedule shipments from sources to

destinations while minimizing total transportation and production costs.
Answer: TRUE
Diff: Easy
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept
6) In a transportation problem, each destination must be supplied by one and only one source.
Answer: FALSE
Diff: Moderate
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

7) In a transportation problem, a single source may supply something to all destinations.

Answer: TRUE
Diff: Moderate
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

8) A transportation problem with intermediate points is called a transshipment problem.

Answer: TRUE
Diff: Moderate
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

9) The transshipment problem is a maximization problem.

Answer: FALSE
Diff: Easy
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

10) The minimal-spanning tree technique finds the shortest route to a series of destinations.
Answer: FALSE
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

11) In the minimal-spanning tree technique, it is necessary to start at the last node in the network.
Answer: FALSE
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

12) The maximal-flow technique would be helpful to city planners in determining how freeways
should be expanded.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

13) The minimal-spanning tree technique determines the path through the network that connects
all the points while minimizing total distance.
Answer: TRUE
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

14) The shortest-route technique is the same as the minimal-spanning tree technique.
Answer: FALSE
Diff: Easy
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

15) Busy highways are often analyzed with the maximal-flow technique.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

16) Transportation companies would definitely be interested in the shortest-route technique to

optimize travel.
Answer: TRUE
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept
17) Cable television companies would employ the shortest-route technique to lay out the cables
connecting individual houses.
Answer: FALSE
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

18) We may begin the maximal-flow technique by picking an arbitrary path through the network.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

19) The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study
water run-off in an attempt to minimize the danger from floods.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

20) The shortest-route technique might be used by someone planning a vacation in order to
minimize the required amount of driving.
Answer: TRUE
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

21) A traveling salesperson might use the shortest route technique to minimize the distance
traveled to reach one of his/her customers.
Answer: TRUE
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept
22) In the minimal-spanning tree technique, if there is a tie for the nearest node, that suggests
that there may be more than one optimal solution.
Answer: TRUE
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

23) The maximal-flow model might be of use to an engineer looking for spare capacity in an oil
pipeline system.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

24) The shortest-route model assumes that one is trying to connect two end points in the shortest
manner possible, rather than attempting to connect all the nodes in the model.
Answer: TRUE
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

25) In the maximal-flow technique, a zero (0) means no flow or a one-way arc.
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

26) The maximal-flow model assumes that there is a net flow from "source" to "sink."
Answer: TRUE
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept
27) If your goal was to construct a network in which all points were connected and the distance
between them was as short as possible, the technique that you would use is
A) shortest-route.
B) maximal-flow.
C) minimal-flow.
D) minimal-spanning tree.
Answer: D
Diff: Moderate
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

28) A line in a network that may represent a path or a route is called a(n)
A) arc.
B) branch.
C) line.
D) fork.
Answer: A
Diff: Easy
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

29) A point in the network, that is at the beginning or end of a route is called a(n)
A) arc.
B) branch.
C) line.
D) node.
Answer: D
Diff: Easy
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept
30) A technique that allows a researcher to determine the greatest amount of material that can
move through a network is called
A) maximal-flow.
B) maximal-spanning.
C) shortest-route.
D) maximal-tree.
Answer: B
Diff: Moderate
Topic: INTRODUCTION
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

31) Transportation models can be used for which of the following decisions?
A) facility location
B) production mix
C) media selection
D) portfolio selection
Answer: A
Diff: Easy
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

32) When using a general LP model for transportation problems, if there are 4 sources and 3
destinations, which of the following statements is true?
A) There are typically 4 decision variables and 3 constraints.
B) There are typically 12 decision variables and 7 constraints.
C) There are typically 7 decision variables and 7 constraints.
D) There are typically 12 decision variables and 12 constraints.
Answer: B
Diff: Moderate
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept
33) The two most common objectives for the assignment problem are the minimization of
A) uncertainty or inexperience.
B) total costs or inexperience.
C) total costs or total time.
D) total time or inexperience.
Answer: C
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Concept

34) Which of the following statements concerning the transshipment problem is false?
A) There can be constraints on the number of units shipped out of an origin point.
B) There can be constraints on the number of units shipped into a destination point.
C) The transshipment problem can be solved with linear programming.
D) Any units shipped from one origin point must all go to the same destination point.
Answer: D
Diff: Moderate
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

35) What is said to exist when total demand equals total supply in a transportation problem?
A) an equalized problem
B) an equilibrialized problem
C) a harmonized problem
D) a balanced problem
Answer: D
Diff: Easy
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept
36) A company must assign mechanics to each of four jobs. The time involved varies according
to individual abilities. Table 9-1 shows how many minutes it takes each mechanic to perform
each job. If the optimal assignments are made, how many total minutes would be required for
completing the jobs?

Table 9-1
Job (Time in Minutes)
1 2 3 4
Worker A 5 9 5 7
B 3 8 4 4
C 5 5 8 4
D 7 4 5 5

A) 0
B) 4
C) 17
D) 16
Answer: D
Diff: Difficult
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application

37) Given Table 9-2, the final table for an assignment problem, who should be assigned to job 2?

Table 9-2
Job (Time in Minutes)
1 2 3 4
Worker A 0 0 2 1
B 1 3 1 0
C 1 0 1 1
D 0 1 0 3

A) worker A
B) worker B
C) worker C
D) worker D
Answer: C
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
38) If items being transported must go through an intermediate point before reaching a final
destination, then this situation is known as a(n)
A) transshipment problem.
B) assignment problem.
C) transportation problem.
D) intermediate point problem.
Answer: A
Diff: Moderate
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Concept

39) The minimal-spanning technique would best be used

A) to assign workers to jobs in the cheapest manner.
B) to determine LAN network wiring within a building.
C) to minimize traffic flow on a busy highway.
D) by a trucking company making frequent but repeatable drops.
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

40) The maximal-flow technique would best be used

A) to assign workers to jobs in the cheapest manner.
B) to determine the number of units to ship from each source to each destination.
C) to determine LAN network wiring within a building.
D) to maximize traffic flow on a busy highway.
Answer: D
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept
41) The final node or destination in a network is called a(n)
A) arc.
B) branch.
C) source.
D) sink.
Answer: D
Diff: Easy
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

42) The origin or beginning node in a network is called

A) home.
B) delta.
C) source.
D) mouth.
E) sink.
Answer: C
Diff: Easy
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept

43) The first step in the maximal-flow technique is to

A) pick the node with the maximum flow.
B) pick any path with some flow.
C) eliminate any node that has a zero flow.
D) add a dummy flow from the start to the finish.
Answer: B
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Concept
44) The shortest-route technique would best be used to
A) determine the number of units to ship from each source to each destination.
B) determine the amount of LAN network wiring within a building.
C) minimize the amount of traffic flow on a busy highway.
D) determine the path for a truck making frequent but repeatable drops.
Answer: D
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

45) When using the shortest-route technique, the first step is to

A) connect the nearest node that minimizes the total distance to the origin.
B) trace the path from the warehouse to the plant.
C) determine the average distance traveled from source to end.
D) find the nearest node to the origin and put a distance box by the node.
Answer: D
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

46) All the nodes must be connected in which of the following techniques?
A) minimal-flow
B) shortest-route
C) maximal-flow
D) minimal-spanning tree
Answer: D
Diff: Easy
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

47) The minimal-spanning tree technique would best be used

A) by a forest ranger seeking to minimize the risk of forest fires.
B) by a telephone company attempting to lay out wires in a new housing development.
C) by an airline laying out flight routes.
D) by an airline assigning crews to work specific flights.
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Concept

48) Which of the following problems can be solved as a linear program using binary decision
variables?
A) maximal-flow problem
B) shortest-route problem
C) minimal-spanning tree problem
D) product mix problem
Answer: B
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

49) When using the shortest-route technique, the second step is to

A) find the next-nearest node to the origin and put the distance in a box by the node.
B) trace the path from the warehouse to the plant.
C) determine the average distance traveled from source to end.
D) find the nearest node to the origin and put a distance box by the node.
Answer: A
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept

50) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 300
2 3 150
1 3 200

A) 450
B) 150
C) 350
D) 650
Answer: C
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
51) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 200
1 3 300
2 3 350
2 4 350
3 4 250

A) 100
B) 750
C) 850
D) 900
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

52) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 100
2 4 150
1 3 200
2 3 50
3 4 175
4 5 250
3 5 300

A) 100
B) 150
C) 550
D) 1225
Answer: C
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
53) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 100
1 3 50
2 3 200
2 5 325
1 4 50
3 4 350
3 5 400
4 5 450

A) 300
B) 525
C) 675
D) 1925
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

54) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node
3.

From To Fluid
Node Node Flow
1 3 400
3 1 100
1 2 300
2 1 0
2 3 100
3 2 100

A) 100
B) 400
C) 500
D) 700
Answer: C
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application

55) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node
4.

From To Fluid
Node Node Flow
1 2 400
2 1 0
1 4 200
4 1 200
1 3 200
3 1 0
2 4 200
4 2 200
3 4 300
4 3 300

A) 200
B) 300
C) 600
D) 700
Answer: C
Diff: Moderate
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
56) Find the shortest route from Node 1 to Node 4 using the shortest-route technique.

From To
Node Node Distance
1 2 300
1 3 200
2 3 50
2 4 250
3 4 450

A) 650
B) 450
C) 550
D) 500
Answer: D
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

57) Find the shortest route from Node 1 to Node 4.

From To
Node Node Distance
1 2 250
1 3 400
1 4 600
2 3 50
2 4 300
3 4 200

A) 750
B) 500
C) 550
D) 600
Answer: B
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
58) Find the shortest route from Node 1 to Node 6.

From To
Node Node Distance
1 2 150
1 3 200
2 4 200
2 3 50
4 6 100
3 4 300
3 5 350
5 6 100

A) 300
B) 450
C) 550
D) 650
Answer: B
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

59) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 120
2 3 100
1 3 200
2 4 150
3 5 90
4 5 170

A) 290
B) 310
C) 620
D) 460
Answer: D
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
60) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 200
1 3 300
1 5 400
2 3 300
2 4 400
3 4 200
3 5 200
4 5 100
4 6 300
5 6 400

A) 1000
B) 800
C) 700
D) 1100
Answer: D
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
61) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 100
1 3 200
2 3 100
2 4 150
2 5 200
3 4 150
3 5 300
4 5 250
4 6 200
5 6 100

A) 900
B) 650
C) 400
D) 1200
Answer: B
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
62) Given the following distances between destination nodes, what is the minimum distance that
connects all the nodes?

From To Distance
1 2 100
1 3 50
2 3 200
2 5 300
1 4 50
3 4 350
3 5 400
3 6 400
4 5 450
4 6 350
5 6 200

A) 900
B) 1200
C) 1100
D) 700
Answer: D
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
63) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node
4.

From To Fluid
Node Node Flow
1 3 200
3 1 0
1 2 150
2 1 50
2 3 100
3 2 100
3 4 150
4 3 50

A) 100
B) 150
C) 200
D) 50
Answer: B
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
64) Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node
5.

From To Fluid
Node Node Flow
1 2 300
2 1 0
1 3 0
3 1 150
1 4 200
4 1 200
1 5 100
5 1 100
2 4 200
4 2 200
3 4 250
4 3 300
3 5 300
5 3 250
4 5 100
5 4 0

A) 300
B) 400
C) 600
D) 500
Answer: D
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
65) Find the shortest route from Node 1 to Node 5 using the shortest-route technique.

From To
Node Node Distance
1 2 200
1 3 150
2 3 50
2 4 300
3 4 250
3 5 200
4 5 150

A) 350
B) 400
C) 450
D) 600
Answer: A
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

66) Find the shortest route from Node 1 to Node 5.

From To
Node Node Distance
1 2 250
1 3 150
1 4 200
2 3 50
2 4 150
3 4 150
3 5 100
2 5 150

A) 200
B) 350
C) 250
D) 450
Answer: C
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

67) Find the shortest route from Node 1 to Node 6.

 From To
Node Node Distance
1 2 150
1 3 200
2 3 100
2 4 200
2 5 50
3 4 350
3 5 300
4 6 100
5 6 100

A) 300
B) 450
C) 550
D) 650
Answer: A
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
68) Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic
flow from City 1 to City 7?

From City To City Flow

1 1 2 4
2 1 3 8
3 1 5 5
4 2 1 0
5 2 4 3
6 2 5 3
7 3 1 0
8 3 5 3
9 3 6 1
10 4 2 3
11 4 5 3
12 4 7 4
13 5 1 1
14 5 2 0
15 5 3 2
16 5 4 0
17 5 6 1
18 5 7 5
19 6 3 1
20 6 5 4
21 6 7 1
22 7 4 2
23 7 5 1
24 7 6 0

A) 1200
B) 1400
C) 900
D) 800
Answer: C
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
69) Solve the minimal-spanning tree problem defined below:

Start End
Branch Cost
Node Node
1 1 3 5
2 1 2 1
3 2 4 3
4 2 5 4
5 3 4 6
6 4 6 2

A) total cost = 13
B) total cost = 15
C) total cost = 17
D) total cost = 11
Answer: B
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

70) Find the shortest route from Node 1 to Node 6.

From To
Node Node Distance
1 1 2 100
2 1 4 215
3 2 3 70
4 2 4 200
5 2 5 110
6 3 4 320
7 4 5 200
8 4 6 200
9 5 6 200

A) total distance = 350

B) total distance = 410
C) total distance = 270
D) total distance = 520
Answer: B
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

71) Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic
flow from Town 1 to Town 7?

From Town To Town Flow

1 1 2 4
2 1 3 7
3 1 5 9
4 2 1 0
5 2 4 3
6 2 5 5
7 3 1 1
8 3 5 3
9 3 6 4
10 4 2 3
11 4 5 1
12 4 7 0
13 5 1 1
14 5 2 0
15 5 3 3
16 5 4 0
17 5 6 5
18 5 7 1
19 6 3 1
20 6 5 6
21 6 7 3
22 7 4 5
23 7 5 2
24 7 6 0

A) max flow = 4 units

B) max flow = 6 units
C) max flow = 3 units
D) max flow = 9 units
Answer: A
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
72) Find the shortest route from Node 6 to Node 1.

From To
Branch Distance
Node Node
1 1 2 150
2 1 3 200
3 2 3 100
4 2 4 200
5 2 5 50
6 3 4 350
7 3 5 300
8 4 6 100
9 5 6 100

A) branches 9, 7, and 2
B) branches 8, 6, and 2
C) branches 8, 6, 7, and 1
D) branches 9, 5, and 1
Answer: D
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
73) Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to
Node 5.

From To Fluid
Node Node Flow
1 1 2 300
2 2 1 0
3 1 3 0
4 3 1 150
5 1 4 200
6 4 1 200
7 1 5 100
8 5 1 100
9 2 4 200
10 4 2 200
11 3 4 250
12 4 3 300
13 3 5 300
14 5 3 250
15 4 5 100
16 5 4 0

A) 300
B) 350
C) 450
D) 500
Answer: D
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
74) Find the least amount of cable that will allow Jack's Cable Company to connect the
following nodes (houses).

From To
Node Node Distance
1 2 250
1 3 150
1 4 400
2 3 50
2 4 100
3 4 200

A) 250
B) 400
C) 350
D) 300

Answer: D
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
75) Given the following nodes and distances, determine the minimum length of cable necessary
to connect all six nodes.

From To
Node Node Distance
1 1 2 150
2 1 3 200
3 2 3 100
4 2 4 200
5 2 5 50
6 3 4 350
7 3 5 300
8 4 6 100
9 5 6 100

A) 200
B) 300
C) 400
D) 500
Answer: D
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
76) Given the following nodes and distances, determine the minimal length of cable necessary to
connect all nodes, using Node 2 as the starting point.

From To Distance
1 1 2 200
2 1 3 300
3 1 5 400
4 2 3 300
5 2 4 400
6 3 4 200
7 3 5 200
8 4 5 100
9 4 6 300
10 5 6 400

A) 1200
B) 1100
C) 900
D) 700
Answer: B
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

77) Which of these statements is best?

A) Assignment problems involve determining the most efficient assignment of people to
projects, salesmen to territories, contracts to bidders, and so on.
B) The objective of an assignment problem solution most often is to maximize the total costs or
time of performing the assigned tasks.
C) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the
column for each respective cell in that row.
D) The objective of an assignment problem solution most often is to minimize the number of
assigned tasks.
Answer: A
Diff: Easy
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Concept
78) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table. Use
Solver to determine which of these assignments is correct.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

A) Project 3 = Dogbert
B) Project 2 = Alice
C) Project 3 = Alice
D) Project 4 = Wally
Answer: A
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
79) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table. Use
Solver to determine which worker is assigned Project 1.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

A) Alice
B) Asok
C) Dilbert
D) Wally
Answer: B
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application

80) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

What is the LP constraint associated with Project 1?

A) DiP1 + WaP1 + AlP1 + AsP1 + DoP1 ≥ 0
B) DiP1 + WaP1 + AlP1 + AsP1 + DoP1 ≥ 1
C) DiP1 + WaP1 + AlP1 + AsP1 + DoP1 = 1
D) DiP1 + WaP1 + AlP1 + AsP1 + DoP1 ≤ 1
Answer: C
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
81) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

What are the components of the objective function associated with Project 3?
A) 29DiP3 + 25WaP3 + 22AlP3 + 34AsP3 + 20DoP3 = 1
B) 29DiP3 + 25WaP3 + 22AlP3 + 34AsP3 + 20DoP3 ≤ 1
C) DiP1 + WaP1 + AlP1 + AsP1 + DoP1 = 1
D) 29DiP3 + 25WaP3 + 22AlP3 + 34AsP3 + 20DoP3
Answer: D
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
82) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

How many decision variables are in an LP formulation of this problem?

A) 25
B) 10
C) 9
D) 5
Answer: A
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
83) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

How many constraints are in an LP formulation of this problem?

A) 25
B) 11
C) 10
D) 5
Answer: B
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
Table 9-3

To demonstrate the personal touch that is part of the Apple experience, Tim Cook decides to
personally deliver the first iCar produced in San Jose to the customer's home in Nashville. In
order to minimize the carbon footprint, he decides to push the car rather than actually driving it,
and since his time is valuable, he wants to choose the shortest route possible. Fortunately, the
first genius he talks to at The Genius Bar is able to determine the drive times between cities Tim
might pass through along the way to Nashville. The cities and drive times are shown in the table
— the push time is assumed to be a direct multiple of the drive time, which will act as a
surrogate to keep the numbers low.

City City Distance

San Jose Albuquerque 15.3
San Jose Phoenix 10.5
San Jose Oklahoma City 23
Albuquerque Oklahoma City 7.83
Albuquerque Chicago 19.3
Phoenix Oklahoma City 14.3
Phoenix New Orleans 22
Oklahoma City Chicago 11.6
Oklahoma City New Orleans 10.3
Oklahoma City Nashville 10
Chicago Nashville 7.25
New Orleans Nashville 8

84) What is the duration of the shortest route for the scenario described in Table 9-3?
A) 33 hours
B) 34.8 hours
C) 40.5 hours
D) 41.3 hours
Answer: A
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
85) How many decision variables are needed to model the scenario described in Table 9-3 using
LP?
A) 11
B) 12
C) 13
D) 14
Answer: B
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

86) How many constraints including the nonnegativity constraint are needed to model the
scenario described in Table 9-3 using LP?
A) 6
B) 7
C) 8
D) 9
Answer: C
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

87) Tim Cook wasn't being observant and mistakenly went to The Evil Genius Bar. The evil
genius there, distinguishable from his counterpart only by his neatly trimmed goatee, decides to
determine the longest route through the network described in Table 9-3. How many hours will
Tim's trip take?
A) 40.5
B) 41.3
C) 42.55
D) 43.65
Answer: D
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
88) Write the elements of the objective function relating to the city of Oklahoma City based on
the information given in Table 9-3.
A) 23SO + 7.83AO + 14.3PO + 11.6OC + 10.3ONo + 10ONa
B) 23SO + 7.83AO + 14.3PO - 11.6OC - 10.3ONo - 10ONa
C) -23SO - 7.83AO - 14.3PO - 11.6OC - 10.3ONo - 10ONa
D) -23SO - 7.83AO - 14.3PO + 11.6OC + 10.3ONo + 10ONa
Answer: A
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

89) What are the elements of the constraint related to the Nashville node based on the
information given in Table 9-3?
A) ONa + CNa + NoNa = 0
B) ONa + CNa + NoNa = 1
C) ONa + CNa + NoNa = 2
D) ONa + CNa + NoNa = 3
Answer: B
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

90) What is the shortest route that uses three stops in between the San Jose and Nashville end
points based on the information given in Table 9-3?
A) 40.55 hours
B) 41.85 hours
C) 41.43 hours
D) 43.653 hours
Answer: C
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
91) A cable company must provide service for 7 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 100
1 to 3 400
1 to 4 300
2 to 3 300
2 to 4 250
2 to 5 400
3 to 5 350
3 to 6 450
4 to 5 300
4 to 7 250
5 to 7 100
6 to 7 150

A) 1000
B) 1050
C) 1100
D) 1150
Answer: A
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
92) A cable company must provide service for 6 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 100
1 to 3 400
1 to 4 300
2 to 3 300
2 to 4 250
2 to 5 400
3 to 5 350
3 to 6 450
4 to 5 300
4 to 6 250

A) 1150
B) 1200
C) 1250
D) 1300
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
93) A cable company must provide service for 6 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 250
1 to 3 400
1 to 4 300
2 to 3 400
2 to 4 400
2 to 5 400
3 to 5 350
3 to 6 450
4 to 5 300
4 to 6 350

A) 1450
B) 1500
C) 1550
D) 1600
Answer: C
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
94) A cable company must provide service for 6 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 500
1 to 3 400
1 to 4 300
2 to 3 400
2 to 4 400
2 to 5 400
3 to 4 350
3 to 5 450
4 to 5 300
4 to 6 350

A) 1550
B) 1600
C) 1650
D) 1700
Answer: D
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
95) A cable company must provide service for 6 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 500
1 to 3 400
1 to 4 300
1 to 5 400
2 to 4 400
2 to 5 400
3 to 4 350
3 to 5 450
4 to 5 300
4 to 6 350

A) 1700
B) 1650
C) 1600
D) 1550
Answer: A
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
96) A cable company must provide service for 6 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). What is
the minimal length of the network required to span the entire neighborhood?

House Distances (yards)

1 to 2 500
1 to 3 400
1 to 4 500
2 to 3 400
2 to 4 400
2 to 5 400
3 to 4 350
3 to 6 550
4 to 5 300
4 to 6 350

A) 1750
B) 1800
C) 1850
D) 1900
Answer: B
Diff: Moderate
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

97) A certain firm has four different operations that must be assigned to four locations. The
profit (in thousands of dollars) associated with each operation at each location is presented
below. The firm's vice president would like to assign the various operations so that the total
profit is maximized. Find the appropriate assignments.

Operations Location
1 2 3 4
W 9 11 7 10
X 10 12 6 12
Y 8 10 13 9
Z 12 8 11 10

Answer: Assign W to 2, X to 4, Y to 3, and Z to 1. Total profit = $48 (thousand)

Diff: Difficult
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application

98) Four projects must be completed, and each of four employees will be assigned to work on
exactly one of the four projects. The table below presents an estimate of the cost that each
employee would incur if working on the respective projects. What is the minimum-cost
assignment of workers to projects?

PROJECT
EMPLOYEE 1 2 3 4
Mary $45 $32 $49 $55
Elizabeth $50 $45 $53 $43
Steven $52 $40 $70 $46
Joshua $60 $35 $40 $40

Answer: Mary to Project 2, Elizabeth to Project 4, Steven to Project 1, Joshua to Project 3

Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application

99) SE Appliances manufacturers refrigerators in Richmond, Charlotte, and Atlanta.

Refrigerators then must be shipped to meet demand in Washington, New York, and Miami. The
table below lists the shipping costs, supply, and demand information.

To
Washington New York Miami Supply
From Richmond $10 $20 $30 1000
Charlotte $15 $25 $20 1500
Atlanta $20 $20 $10 2000
Demand 1000 1800 1200

How many units should be shipped from each plant to each retail store in order to minimize
shipping costs?
Answer: Ship 1000 units from Richmond to New York, 1000 units from Charlotte to
Washington, 800 units from Atlanta to New York, and 1200 units from Atlanta to Miami, with
the 500 from Charlotte to the Dummy unshipped.
Diff: Moderate
Topic: THE TRANSPORTATION PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Application
100) Neki Sports Company manufactures treadmills in factories located in Pittsburgh and Kansas
City. These are shipped to regional distribution centers in Chicago, Phoenix, and Philadelphia.
Ultimately they are delivered to supply houses in New York and Los Angeles. The available
supplies at the factories, demands at the final destinations, and shipping costs are illustrated in
the table below.

To
From Chicago Phoenix Philadelphia New York Los Angeles Supply
Pittsburgh $4 $8 $2 — — 1500
Kansas City $3 $6 $5 — — 1000
Chicago — — — 5 7 —
Phoenix — — — 8 3 —
Philadelphia — — — 2 9 —
Demand — — — 1200 800 —

Formulate this problem as a linear program.

Answer: Let (1) = Pittsburgh, (2) = Kansas City, (3) = Chicago, (4) = Phoenix, (5) =
Philadelphia, (6) = New York, and (7) = Los Angeles

Let xij = the number of units shipped from location i to location j.

The LP is as follows:

Minimize total cost = 4x13 + 3x23 + 8x14 + 6x24 + 2x15 + 5x25 + 5x36 + 8x46 + 2x56 + 7x37
+ 3x47 + 9x57
Subject to: x13 + x14 + x15 ≤ 1500
x23 + x24 + x25 ≤ 1000
x13 + x23 = x36 + x37
x14 + x24 = x46 + x47
x15 + x25 = x56 + x57
x36 + x46 + x56 = 1200
x37 + x47 + x57 = 800
All xij ≥ 0
Diff: Moderate
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Application
101) Neki Sports Company manufactures treadmills in factories located in Pittsburgh and Kansas
City. These are shipped to regional distribution centers in Chicago, Phoenix, and Philadelphia.
Ultimately they are delivered to supply houses in New York and Los Angeles. The available
supplies at the factories, demands at the final destinations, and shipping costs are illustrated in
the table below.

To
From Chicago Phoenix Philadelphia New York Los Angeles Supply
Pittsburgh $4 $8 $2 — — 1500
Kansas City $3 $6 $5 — — 1000
Chicago — — — 5 7 —
Phoenix — — — 8 3 —
Philadelphia — — — 2 9 —
Demand — — — 1200 800 —

Determine how many units should be shipped for all possible origin and destination points (final
or intermediate) in the distribution network in order to minimize shipping costs.
Answer: The best solution is to ship 1200 units from Pittsburgh to Philadelphia, ship 800 units
from Kansas City to Phoenix, then 1200 units from Philadelphia to New York, and 800 units
from Phoenix to Los Angeles.
Diff: Moderate
Topic: THE TRANSSHIPMENT PROBLEM
LO: 9.1: Construct LP problems for the transportation, assignment, and transshipment models.
AACSB: Analytical thinking
Classification: Application
102) Find the shortest route from Node 1 to each of the other nodes in the transportation network
represented below.

Route
from Node Distance
1 to 2 50
1 to 3 100
2 to 3 75
2 to 4 65
3 to 4 80
3 to 5 70
4 to 5 65
4 to 6 200
5 to 6 130

Answer:
Shortest
Node Route Distance
2 1-2 50
3 1-3 100
4 1-2-4 115
5 1-3-5 170
6 1-2-4-5-6 310

Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
103) As part of the planning for a major office development project, it is necessary to install
telephone line to the buildings. Information about the project is given below. The distances are
provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e.,
total distance) are minimized? What is the total length of this?

Building Distances (100s ft)

1 to 2 4
1 to 4 3
2 to 3 2
2 to 4 4
3 to 5 1
3 to 6 5
4 to 5 3
4 to 7 3
5 to 7 2
6 to 7 6

Answer: One solution is to connect 1-4, 2-3, 3-6, 3-5, 4-5, 5-7. Total length = 16.
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
104) A cable company must provide service for 7 houses in a particular neighborhood. They
would like to wire the neighborhood in a way to minimize the wiring costs (or distance). How
should the cable company wire the neighborhood and what would be the minimal length of the
network?

House Distances (yards)

1 to 2 100
1 to 3 400
1 to 4 300
2 to 3 300
2 to 4 250
2 to 5 400
3 to 5 350
3 to 6 450
4 to 5 300
4 to 7 250
5 to 7 100
6 to 7 150

Answer: One solution is to connect 1-2, 2-3, 2-4, 4-7, 5-7, 6-7. Total length = 1150.
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application
105) Given a network with the following distances:

From To
Node Node Distance
1 2 4
1 3 1
2 3 2
2 4 3
3 4 6
3 5 3
3 6 9
4 5 7
5 6 5

Determine which nodes should be connected to get the minimum distance from Nodes 1 through
6.
Determine the minimum distance.
Answer: Connect 1-3-5-6.
Minimum distance = 9
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application

106) The west-to-east air traffic system passing through the United States can handle aircraft
flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load
(From City 1 to City 5) in aircraft per hour that this system can handle?

To To To To To
From 1 2 3 4 5
City 1 — 2 — 4 —
City 2 1 — 2 3 3
City 3 2 2 — 5 2
City 4 — — — — 3
City 5 — 2 2 1 —

Answer: Route 1-2-3-5 can handle 200 per hour, and Route 1-4-5 can handle 300 per hour for a
total of 500 aircraft per hour.
Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
107) Find the shortest route from Node 1 to each of the other nodes in the transportation network
represented below.

Route
From Node Distance
1 to 2 50
1 to 3 100
2 to 3 75
2 to 5 60
3 to 4 80
3 to 5 70
3 to 6 65
4 to 6 200
5 to 6 150

Answer:
Shortest
Node Route Distance
2 1-2 50
3 1-3 100
4 1-3-4 180
5 1-2-5 110
6 1-3-6 165

Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
108) A logistics company is determining the shortest route to get to a selected final destination.
What is the sequence of nodes that comprise the shortest distance to the final destination? The
information on possible paths and distances is given below:

Route
From Node Distance
1 to 2 50
1 to 3 100
1 to 4 125
2 to 4 75
2 to 5 180
3 to 4 100
3 to 5 125
4 to 5 170
4 to 6 200
5 to 6 125
5 to 7 100
6 to 7 75

Answer: 1-3-5-7 = 325

Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
109) As part of the planning for a major office development project, it is necessary to install
telephone lines to the buildings. Information about the project is given below. The distances are
provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e.,
total distance) are minimized? What is the total length of this?

Buildings Distances (100s ft)

1 to 2 4
1 to 3 3
1 to 4 2
2 to 4 4
3 to 5 1
3 to 6 5
4 to 5 3
4 to 7 3
5 to 7 2
6 to 7 6

Answer: Connect: 1-4, 4-5, 5-7, 3-6, 5-3, and either 4-2 or 1-2. Total length is 1700 feet.
Alternate solutions exist.
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

110) Brantley College has decided to "wire" its campus. The first stage in this effort is to install
the "backbone," i.e., to connect all the buildings. The table below gives the distances between the
various buildings on campus in hundreds of feet. How should the buildings be connected to
minimize the total length of cable? What length of cable is required?

Distances in Hundreds of Feet

From To
Building 1 Building 2 Building 3 Building 4 Building 5 Building 6
Building 1 3 7 5 5 4
Building 2 5 2 6 6
Building 3 5 4 4
Building 4 5 3
Building 5 4
Building 6

Answer: Connect: 1-2, 2-4, 4-6, 3-5, 5-6. Total length is 1600 feet.
Diff: Difficult
Topic: MINIMAL-SPANNING TREE PROBLEM
LO: 9.5: Solve minimal-spanning tree problems.
AACSB: Analytical thinking
Classification: Application

111) Given a network with the following distances:

 From To
Node Node Distance
1 2 4
1 4 1
2 3 2
2 4 3
3 4 6
3 5 4
3 6 2
4 5 7
4 7 5
5 6 5
5 7 8
6 7 4

Determine which nodes should be connected to get the minimum distance flowing from Node 1
through Node 7.
Determine the minimum distance.
Answer: Connect: 1-4, 4-7.
Minimum distance = 6
Diff: Difficult
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
112) The east-to-west (City 5 to City 1) air traffic system passing through the United States can
handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak
air traffic load in aircraft per hour from City 5 to City 1 that this system can handle?

To
From City 1 City 2 City 3 City 4 City 5
City 1 — 1 2 —
City 2 2 — 2 2
City 3 2 — 2
City 4 4 3 5 — 1
City 5 — 3 2 3 —

Answer: 500 aircraft per hour.

Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application

113) A water company is analyzing the flow of water through pipes in an office building. The
flow capacities are given in the table below. Flow is measured in 100 gallons/hour. What is the
maximal flow of water from node 1 to node 5?

To
From Node 1 Node 2 Node 3 Node 4 Node 5
Node 1 — 3 4 —
Node 2 2 — 5 6 3
Node 3 2 — 4
Node 4 4 3 5 — 1
Node 5 — 6 5 3 —

Answer: 700 gallons per hour.

Diff: Difficult
Topic: MAXIMAL-FLOW PROBLEM
LO: 9.3: Use LP to model and solve maximal-flow problems.
AACSB: Analytical thinking
Classification: Application
114) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

Use Solver to determine the optimal assignment.

Answer: This assignment results in the minimum cost of $104
Project 1 = Asok, Project 2 = Wally, Project 3 = Dogbert, Project 4 = Dilbert, Project 5 = Alice
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
115) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

What is the full formulation of the LP that solves this problem?

Answer: Minimize 22DiP1 + 21WaP1 + 25AlP1 + 26AsP1 + 30DoP1 +
25DiP2 + 19WaP2 + 22AlP2 + 27AsP2 + 28DoP2 +
29DiP3 + 25WaP3 + 22AlP3 + 34AsP3 + 20DoP3 +
20DiP4 + 23WaP4 + 27AlP4 + 26AsP4 + 24DoP4 +
24DiP5 + 48WaP5 + 19AlP5 + 24AsP5 + 27DoP5
Subject to: DiP1 + WaP1 + AlP1 + AsP1 + DoP1 = 1
DiP2 + WaP2 + AlP2 + AsP2 + DoP2 = 1
DiP3 + WaP3 + AlP3 + AsP3 + DoP3 = 1
DiP4 + WaP4 + AlP4 + AsP4 + DoP4 = 1
DiP5 + WaP5 + AlP5 + AsP5 + DoP5 = 1
DiP1 + DiP2 + DiP3 + DiP4 + DiP5 = 1
WaP1 + WaP2 + WaP3 + WaP4 + WaP5 = 1
AlP1 + AlP2 + AlP3 + AlP4 + AlP5 = 1
AsP1 + AsP2 + AsP3 + AsP4 + AsP5 = 1
DoP1 + DoP2 + DoP3 + DoP4 + DoP5 = 1
All decision variables ≥ 0
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
116) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 21 25 26 30
2 25 19 22 27 28
3 29 25 22 34 20
4 20 23 27 26 24
5 24 48 19 24 27

The Pointy-haired boss knows a thing or two about optimization and decides to formulate the
problem as a cost maximization problem. Use Solver to determine the answer he arrives at.
Answer: This assignment results in the minimum cost of $164
Project 1 = Dogbert, Project 2 = Dilbert, Project 3 = Asok, Project 4 = Alice, Project 5 = Wally
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application

117) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 22 25 27 30
2 25 26 22 25 28
3 29 25 23 30 28
4 26 23 27 26 24
5 24 24 26 24 27

Use Solver to determine the optimal assignment.

Answer: This assignment results in the minimum cost of $117
Project 1 = Dilbert, Project 2 = Alice, Project 3 = Wally, Project 4 = Dogbert, Project 5 = Asok
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
118) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 22 25 27 30
2 25 26 22 25 28
3 29 25 23 30 28
4 26 23 27 26 24
5 24 24 26 24 27

What is the full formulation of the LP that solves this problem?

Answer: Minimize 22DiP1 + 22WaP1 + 25AlP1 + 27AsP1 + 30DoP1 +
25DiP2 + 26WaP2 + 22AlP2 + 25AsP2 + 28DoP2 +
29DiP3 + 25WaP3 + 23AlP3 + 30AsP3 + 28DoP3 +
26DiP4 + 23WaP4 + 27AlP4 + 26AsP4 + 24DoP4 +
24DiP5 + 24WaP5 + 26AlP5 + 24AsP5 + 27DoP5
Subject to: DiP1 + WaP1 + AlP1 + AsP1 + DoP1 = 1
DiP2 + WaP2 + AlP2 + AsP2 + DoP2 = 1
DiP3 + WaP3 + AlP3 + AsP3 + DoP3 = 1
DiP4 + WaP4 + AlP4 + AsP4 + DoP4 = 1
DiP5 + WaP5 + AlP5 + AsP5 + DoP5 = 1
DiP1 + DiP2 + DiP3 + DiP4 + DiP5 = 1
WaP1 + WaP2 + WaP3 + WaP4 + WaP5 = 1
AlP1 + AlP2 + AlP3 + AlP4 + AlP5 = 1
AsP1 + AsP2 + AsP3 + AsP4 + AsP5 = 1
DoP1 + DoP2 + DoP3 + DoP4 + DoP5 = 1
All decision variables ≥ 0
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
119) The Pointy-haired boss has five projects to assign and decides to go against all convention
and assign them to individuals rather than project teams. He has the Elbonians estimate the labor
cost in dollars of each possible assignment and that information is summarized in the table.

Labor Costs for each possible assignment

Project Dilbert Wally Alice Asok Dogbert
1 22 22 25 27 30
2 25 26 22 25 28
3 29 25 23 30 28
4 26 23 27 26 24
5 24 24 26 24 27

The Pointy-haired boss knows a thing or two about optimization and decides to formulate the
problem as a cost maximization problem. Use Solver to determine the answer he arrives at.
Answer: This assignment results in the maximum cost of $138
Project 1 = Dogbert, Project 2 = Wally, Project 3 = Asok, Project 4 = Dilbert, Project 5 = Alice
Diff: Moderate
Topic: THE ASSIGNMENT PROBLEM
LO: 9.2: Solve facility location and other application problems with transportation models.
AACSB: Analytical thinking
Classification: Application
Table 9-3

To demonstrate the personal touch that is part of the Apple experience, Tim Cook decides to
personally deliver the first iCar produced in San Jose to the customer's home in Nashville. In
order to minimize the carbon footprint, he decides to push the car rather than actually driving it,
and since his time is valuable, he wants to choose the shortest route possible. Fortunately, the
first genius he talks to at The Genius Bar is able to determine the drive times between cities Tim
might pass through along the way to Nashville. The cities and drive times are shown in the table
— the push time is assumed to be a direct multiple of the drive time, which will act as a
surrogate to keep the numbers low.

City City Distance

San Jose Albuquerque 15.3
San Jose Phoenix 10.5
San Jose Oklahoma City 23
Albuquerque Oklahoma City 7.83
Albuquerque Chicago 19.3
Phoenix Oklahoma City 14.3
Phoenix New Orleans 22
Oklahoma City Chicago 11.6
Oklahoma City New Orleans 10.3
Oklahoma City Nashville 10
Chicago Nashville 7.25
New Orleans Nashville 8

120) Use Solver to determine the shortest route between San Jose and Nashville.
Answer: The shortest route is 33 hours (while driving) and takes the path from San Jose to
Oklahoma City and Oklahoma City to Nashville.
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Application
121) Write the objective function and constraints for this problem modeled as an LP.
Answer: Minimize: 15.3SA+10.5SP + 23SO + 7.83AO + 19.3AC + 14.3PO + 22PNo +
11.6OC + 10.3ONo +
10ONa + 7.25CNa + 8NoNa
Subject to: SA + SP + SO = 1
SA - AC - AO = 0
SP - PO - PNo = 0
SO + AO + PO - OC - Ono - Ona = 0
AC + OC - CNa = 0
PNo + ONo - NoNa = 0
ONa + CNa + NoNa = 1
Diff: Moderate
Topic: SHORTEST-ROUTE PROBLEM
LO: 9.4: Use LP to model and solve shortest route problems.
AACSB: Analytical thinking
Classification: Concept