Professional Documents
Culture Documents
TRUE/FALSE
12.1
The minimal-spanning tree technique finds the shortest route to a series of destinations.
ANSWER: FALSE
12.2
In the minimal-spanning tree technique, it is necessary to start at the last node in the network.
ANSWER: FALSE
12.3
The maximal-flow technique would be helpful to city planners in determining how freeways
should be expanded.
ANSWER: TRUE
12.4
The shortest-route technique requires that each node in the network be connected to at least one
other node.
ANSWER: FALSE
12.5
12.6
As illustrated in the text, the three network optimizing techniques are designed specifically to
solve primarily small, simple problems.
ANSWER: FALSE
12.7
The Etah Dairy, New Delhi, India, has successfully used the maximal-flow technique to improve
milk volume.
ANSWER: FALSE
12.8
12.9
120
12.10
Cable television companies would employ the shortest-route technique to lay out the cables
connecting individual houses.
ANSWER: FALSE
12.11
The minimal-spanning tree problem will always have a unique optimal solution.
ANSWER: FALSE
12.12
We may begin the maximal-flow technique by picking an arbitrary path through the network.
ANSWER: TRUE
12.13
In the maximal-flow technique, pathways are indicated by nodes, and the connections between
them by lines.
ANSWER: TRUE
12.14
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
12.15
The shortest-route technique might be used by someone planning a vacation in order to minimize
the required amount of driving.
ANSWER: TRUE
12.16
The maximal-flow technique might be used by New York City traffic engineers to study the
impact of different stop light sequences on traffic moving through the city.
ANSWER: FALSE
12.17
In the shortest-route technique, locations are indicated by nodes, and the pathways connecting
them by lines.
ANSWER: TRUE
*12.18
A traveling salesman might use the shortest route technique to minimize the distance traveled to
reach one of his customers.
ANSWER: TRUE
*12.19
A computer design engineer might use the minimal-spanning tree model to determine the data
paths among various elements in the computer.
ANSWER: FALSE
121
*12.20
One might use the minimal-spanning model to minimize the time spent to complete a set of tasks
when the time to perform a task is dependent on the previous task accomplished.
ANSWER: FALSE
*12.21
For a traveling salesman attempting to plan his/her route between customers, the shortest-route
model would be of greater assistance than the minimal spanning tree model.
ANSWER: TRUE
*12.22
The maximal flow model might be of use to an engineer looking for spare capacity in an oil
pipeline system.
ANSWER: TRUE
*12.23
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
*12.24
The maximal-flow model assumes that there are alternate arcs between each pair of nodes.
ANSWER: FALSE
*12.25
The maximal-flow model assumes that there is a net flow from source to sink.
ANSWER: TRUE
*12.26
All of the network models assume that each node is connected to every other node through at
most two arcs.
ANSWER: FALSE
*12.27
A fundamental assumption of the minimal spanning tree model is that all nodes in the model must
be connected.
ANSWER: TRUE
122
MULTIPLE CHOICE
12.28
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)
(b)
(c)
(d)
shortest-route.
maximal-flow.
minimal-spanning tree.
none of the above
ANSWER: c
12.29
ANSWER: a
12.30
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
2
1
(a)
(b)
(c)
(d)
(e)
To
2
3
3
Distance
100
150
200
100
250
350
450
none of the above
ANSWER: b
123
12.31
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
1
2
2
3
(a)
(b)
(c)
(d)
(e)
To
2
3
3
4
4
Distance
200
300
350
350
250
100
750
850
900
none of the above
ANSWER: b
12.32
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
2
1
2
3
4
3
(a)
(b)
(c)
(d)
(e)
To
2
4
3
3
4
5
5
Distance
100
150
200
50
175
250
300
100
150
550
1225
none of the above
ANSWER: c
124
12.33
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
1
2
2
1
3
3
4
(a)
(b)
(c)
(d)
(e)
To
2
3
3
5
4
4
5
5
Distance
100
50
200
325
50
350
400
450
300
525
675
1925
none of the above
ANSWER: b
12.34
ANSWER: b
12.35
A technique which allows a researcher to determine the greatest amount of material that can move
through a network is called
(a)
(b)
(c)
(d)
maximal-flow.
maximal-spanning.
shortest-route.
none of the above
ANSWER: a
12.36
ANSWER: b
12.37
Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 3.
From
Node
To
Node
Fluid
Flow
125
1
3
1
2
2
3
(a)
(b)
(c)
(d)
(e)
3
1
2
1
3
2
400
100
300
0
100
100
100
400
500
700
none of the above
ANSWER: c
12.38
Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.
From
Node
1
2
1
4
1
3
2
4
3
4
(a)
(b)
(c)
(d)
(e)
To
Node
2
1
4
1
3
1
4
2
4
3
Fluid
Flow
400
0
200
200
200
0
200
200
300
300
200
300
600
700
none of the above
ANSWER: c
126
12.39
ANSWER: c
12.40
connect the nearest node that minimizes the total distance to the origin.
trace the path from the warehouse to the plant.
determine the average distance traveled from source to end.
find the nearest node to the origin and put a distance box by the node.
none of the above
ANSWER: d
12.41
ANSWER: b
12.42
Find the shortest route from Node 1 to Node 4 using the shortest-route technique.
From
Node
1
1
2
2
3
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
3
4
4
Distance
100
200
50
350
250
250
400
450
600
none of the above
ANSWER: b
127
12.43
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
4
3
4
4
Distance
250
150
400
50
100
200
300
350
400
450
none of the above
ANSWER: a
12.44
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
4
3
6
4
5
6
Distance
150
200
200
50
100
300
350
100
300
450
550
650
none of the above
ANSWER: b
12.45
shortest-route
maximal flow
minimal-spanning tree
all of the above
ANSWER: c
128
12.46
by a hospital trying to lay out a route for the collection of lab samples.
by a grocer trying to lay out a route for his delivery truck.
by an airline laying out flight routes.
none of the above
all of the above
ANSWER: d
12.47
ANSWER: b
12.48
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
2
1
2
3
4
(a)
(b)
(c)
(d)
(e)
To
2
3
3
4
5
5
Distance
120
100
200
150
90
170
290
310
620
460
none of the above
ANSWER: d
129
12.49
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
1
1
2
2
3
3
4
4
5
(a)
(b)
(c)
(d)
(e)
To
2
3
5
3
4
4
5
5
6
6
Distance
200
300
400
300
400
200
200
100
300
400
1000
800
700
1100
none of the above
ANSWER: d
12.50
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
1
2
2
2
3
3
4
4
5
(a)
(b)
(c)
(d)
(e)
To
2
3
3
4
5
4
5
5
6
6
Distance
100
200
100
150
200
150
300
250
200
100
900
650
400
1200
none of the above
ANSWER: b
130
12.51
Given the following distances between destination nodes, what is the minimum distance that
connects the nodes?
From
1
1
2
2
1
3
3
3
4
4
5
(a)
(b)
(c)
(d)
(e)
To
Distance
100
50
200
300
50
350
400
400
450
350
200
900
1200
1100
800
none of the above
ANSWER: d
12.52
ANSWER: b
12.53
131
12.54
ANSWER: c
12.55
Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.
From
Node
1
3
1
2
2
3
3
4
(a)
(b)
(c)
(d)
(e)
To
Node
3
1
2
1
3
2
4
3
Fluid
Flow
200
0
150
50
100
100
150
50
100
150
200
50
none of the above
ANSWER: b
132
12.56
Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 5.
From
Node
1
2
1
3
1
4
1
5
2
4
3
4
3
5
4
5
(a)
(b)
(c)
(d)
(e)
To
Node
2
1
3
1
4
1
5
1
4
2
4
3
5
3
5
4
Fluid
Flow
300
0
0
150
200
200
100
100
200
200
250
300
300
250
100
0
300
400
600
500
none of the above
ANSWER: d
12.57
ANSWER: c
12.58
find the next-nearest node to the origin and put the distance in a box by the node.
trace the path from the warehouse to the plant.
determine the average distance traveled from source to end.
find the nearest node to the origin and put a distance box by the node.
none of the above
ANSWER: a
12.59
133
(c) finding the most scenic route to allow travel to several places during a trip on spring break.
(d) connecting all the points of a network together while minimizing the number of pathways.
(e) none of the above
ANSWER: b
12.60
Find the shortest route from Node 1 to Node 5 using the shortest-route technique.
From
Node
1
1
2
2
3
3
4
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
3
4
4
5
5
Distance
200
150
50
300
250
200
150
350
400
450
600
none of the above
ANSWER: a
134
12.61
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
4
3
4
4
5
5
Distance
250
150
200
50
150
150
100
150
200
350
250
450
none of the above
ANSWER: c
12.62
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
3
4
5
4
5
6
6
Distance
150
200
100
200
50
350
300
100
100
300
450
550
650
none of the above
ANSWER: a
135
12.63
Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow
from City 1 to City 7?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
(a)
(b)
(c)
(d)
(e)
From City
1
1
1
2
2
2
3
3
3
4
4
4
5
5
5
5
5
5
6
6
6
7
7
7
2
3
5
1
4
5
1
5
6
2
5
7
1
2
3
4
6
7
3
5
7
4
5
6
4
8
5
0
3
3
0
3
1
3
3
4
1
0
2
0
1
5
1
4
1
2
1
0
1200
1400
900
800
none of the above
ANSWER: c
*12.64
Which of the following models would likely be most useful in deciding where to run network
cables to wire the various rooms in your building?
(a)
(b)
(c)
(d)
(e)
shortest route
traveling salesman
minimal-spanning model
maximal flow model
none of the above
ANSWER: c
136
*12.65
Start
Node
1
1
2
2
3
4
1
2
3
4
5
6
(a)
(b)
(c)
(d)
(e)
End
Node
3
2
4
5
4
6
total cost = 13
total cost = 15
total cost = 17
total cost = 11
none of the above
ANSWER: b
*12.66
1
2
3
4
5
6
7
8
9
(a)
(b)
(c)
(d)
(e)
1
1
2
2
2
3
4
4
5
Distance
2
100
4
215
3
70
4
200
5
110
4
320
5
200
6
200
6
200
ANSWER: b
137
Cost
5
1
3
4
6
2
*12.67
Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow
from Town 1 to Town 7?
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
(a)
(b)
(c)
(d)
(e)
138
Flow
4
7
9
0
3
5
1
3
4
3
1
0
1
0
3
0
5
1
1
6
3
5
2
0
*12.68
1
2
3
4
5
6
7
8
9
(a)
(b)
(c)
(d)
(e)
From
Node
1
1
2
2
2
3
3
4
5
To
Node
2
3
3
4
5
4
5
6
6
Distance
150
200
100
200
50
350
300
100
100
branches 9, 7, and 2
branches 8, 6, and 2
branches 8, 6, 7, and 1
branches 9, 5, and 1
none of the above
ANSWER: d
*12.69
Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to
Node 5.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
(a)
(b)
(c)
(d)
(e)
From
Node
1
2
1
3
1
4
1
5
2
4
3
4
3
5
4
5
To
Node
2
1
3
1
4
1
5
1
4
2
4
3
5
3
5
4
Fluid
Flow
300
0
0
150
200
200
100
100
200
200
250
300
300
250
100
0
250
300
350
400
none of the above
ANSWER: d
*12.70
Find the least amount of cable that will allow Jacks Cable Company to connect the following
nodes (houses).
139
From
Node
1
1
1
2
2
3
(a)
(b)
(c)
(d)
(e)
To
Node
2
3
4
3
4
4
Distance
250
150
400
50
100
200
250
400
350
300
none of the above
ANSWER: d
*12.71
Given the following nodes and distances, determine the minimum length of cable necessary to
connect all six nodes.
1
2
3
4
5
6
7
8
9
(a)
(b)
(c)
(d)
(e)
From
Node
1
1
2
2
2
3
3
4
5
To
Node
2
3
3
4
5
4
5
6
6
200
300
400
500
none of the above
ANSWER: d
140
Distance
150
200
100
200
50
350
300
100
100
*12.72
Given the following list of nodes and distances, determine the minimal amount of cable needed to
connect all nodes.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
(a)
(b)
(c)
(d)
(e)
Node
1
2
1
3
1
4
1
5
2
4
3
4
3
5
4
5
Node
2
1
3
1
4
1
5
1
4
2
4
3
5
3
5
4
Distance
300
0
0
150
200
200
100
100
200
200
250
300
300
250
100
0
400
300
200
100
none of the above
ANSWER: d
*12.73
Given the following nodes and distances, determine the minimal length of cable necessary to
connect all nodes, using node 2 as the starting point.
1
2
3
4
5
6
7
8
9
10
(a)
(b)
(c)
(d)
(e)
*12.74
From
1
1
1
2
2
3
3
4
4
5
To
2
3
5
3
4
4
5
5
6
6
Distance
200
300
400
300
400
200
200
100
300
400
1200
1100
900
700
none of the above
ANSWER: b
What happens to the solution for the previous problem when we remove the possibility of using
link 9, from node 4 to node 6?
141
(a)
(b)
(c)
(d)
(e)
ANSWER: a
PROBLEMS
12.75
Find the shortest route from Node 1 to each of the other nodes in the transportation network
represented below.
Route from Distance
Node
1 to 2
50
1 to 3
100
2 to 3
75
2 to 4
60
3 to 4
80
3 to 5
70
4 to 5
65
4 to 6
200
5 to 6
150
ANSWER:
Node
2
3
4
5
6
ShortestDistance
Route
1-2
50
1-3
100
1-2-4 110
1-3-5 170
1-2-4-6 310
142
12.76
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
1 to 2
1 to 4
2 to 3
2 to 4
3 to 5
3 to 6
4 to 5
4 to 7
5 to 7
6 to 7
ANSWER:
12.77
One solution is to connect 1-4, 2-3, 3-6, 3-5, 4-5, 5-7. Total length = 16.
To Node
2
3
3
4
4
5
6
5
6
Distance
4
1
2
3
6
4
2
7
5
(a) Determine which nodes should be connected to get the minimum distance.
(b) Determine the minimum distance.
ANSWER:
(a) Connect 1-3, 2-3, 2-4, 3-5, 3-6
(b) Minimum distance = 12
143
12.78
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?
From
1
2
3
4
To
1
1
2
-
5
3
2
3
Find the shortest route from Node 1 to each of the other nodes in the transportation network
represented below.
Route From NodeDistance
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:
Node
2
3
4
5
6
Shortest
Route
1-2
1-3
1-3-4
1-2-5
1-2-5-6
144
Distance
50
100
180
110
260
12.80
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
1 to 2
1 to 3
1 to 4
2 to 4
3 to 5
3 to 6
4 to 5
4 to 7
5 to 7
6 to 7
ANSWER:
12.81
Connect: 1-4, 4-5, 5-7, 3-6, 5-3, and either 4-2 or 1-2. Total length is 1700 feet.
Brantley College has decided to "wire" their 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 1
Building 2
Building 3
Building 4
Building 5
Building 6
Building
2
3
Building
3
7
5
Building
4
5
2
5
Building
5
5
6
4
5
ANSWER: Connect: 1-2, 2-4, 4-6, 3-5, 5-6. Total length is 1600 feet.
145
Building
6
4
6
4
3
4
12.82
To Node
2
4
3
4
4
5
6
5
7
6
7
7
Distance
4
1
2
3
6
4
2
7
5
5
8
4
(a) Determine which nodes should be connected to get the minimum distance.
(b) Determine the minimum distance.
ANSWER:
(a) Connect: 1-4, 1-2, 2-3, 3-6, 3-5, 6-7.
(b) Minimum distance = 17.
146
12.83
The east-to-west (City 5 to City 1) air traffic system passing through the U.S. 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?
From
City 1
City 2
City 3
City 4
City 5
To
City 1
2
4
-
City 2
1
2
3
3
City 3
2
2
5
2
City 4
City 5
2
2
1
-
SHORT ANSWER/ESSAY
12.84
List three different network models that can be used to optimize a variety of problems.
ANSWER: minimal-spanning technique, maximal-flow technique, shortest-route technique
12.85
12.86
12.87
147