51) The maximal-flow technique might be used A) to help design the moving sidewalks
admin
51) The maximal-flow technique might be
used
A) to help design the moving sidewalks
transporting passengers from one terminal to another in a busy airport.
B) by someone designing the traffic
approaches to an airport.
C) by someone attempting to design roads
that would limit the flow of traffic through an area.
D) All of the above
E) None of the above
52) 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) A and B
E) A, B, and C
53) The shortest-route technique would
best be used to
A) plan the routes for a vacation driving
tour.
B) plan the route for a school bus.
C) determine the path for a truck making
frequent runs from a factory to a warehouse.
D) All of the above
E) None of the above
54) 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.
E) None of the above
55) 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
E) None of the above
56) 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
E) None of the above
57) 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
E) None of the above
58) 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
E) None of the above
59) Pipeline fluid flows are indicated below.
Determine the maximum flow from Node 1 to Node 3.
From
Node
To
Node
Fluid
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
E) None of the above
60) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 4.
From
Node
To
Node
Fluid
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
E) None of the above
61) Find the shortest route from Node 1 to
Node 4 using the shortest-route technique.
From
Node
To
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
E) 800
62) Find the shortest route from Node 1 to
Node 4.
From
Node
To
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
E) 50
63) Find the shortest route from Node 1 to
Node 6.
From
Node
To
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
E) None of the above
64) 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
E) None of the above
65) 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
E) None of the above
66) 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
E) None of the above
67) 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
E) None of the above
68) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 4.
From
Node
To
Node
Fluid
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
E) None of the above
69) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 5.
From
Node
To
Node
Fluid
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
E) None of the above
70) Find the shortest route from Node 1 to
Node 5 using the shortest-route technique.
From
Node
To
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
E) None of the above51) The maximal-flow technique might be
usedA) to help design the moving sidewalks
transporting passengers from one terminal to another in a busy airport.B) by someone designing the traffic
approaches to an airport.C) by someone attempting to design roads
that would limit the flow of traffic through an area.D) All of the aboveE) None of the above52) Which of the following problems can be
solved as a linear program using binary decision variables?A) maximal-flow problemB) shortest-route problemC) minimal-spanning tree problemD) A and BE) A, B, and C53) The shortest-route technique would
best be used toA) plan the routes for a vacation driving
tour.B) plan the route for a school bus.C) determine the path for a truck making
frequent runs from a factory to a warehouse.D) All of the aboveE) None of the above54) When using the shortest-route
technique, the second step is toA) 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.E) None of the above55) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance123002315013200A) 450B) 150C) 350D) 650E) None of the above56) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance1220013300233502435034250A) 100B) 750C) 850D) 900E) None of the above57) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance1210024150132002350341754525035300A) 100B) 150C) 550D) 1225E) None of the above58) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance12100135023200253251450343503540045450A) 300B) 525C) 675D) 1925E) None of the above59) Pipeline fluid flows are indicated below.
Determine the maximum flow from Node 1 to Node 3.FromNodeToNodeFluidFlow1340031100123002102310032100A) 100B) 400C) 500D) 700E) None of the above60) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 4.FromNodeToNodeFluidFlow1240021014200412001320031024200422003430043300A) 200B) 300C) 600D) 700E) None of the above61) Find the shortest route from Node 1 to
Node 4 using the shortest-route technique.FromNodeToNodeDistance123001320023502425034450A) 650B) 450C) 550D) 500E) 80062) Find the shortest route from Node 1 to
Node 4.FromNodeToNodeDistance12250134001460023502430034200A) 750B) 500C) 550D) 600E) 5063) Find the shortest route from Node 1 to
Node 6.FromNodeToNodeDistance121501320024200235046100343003535056100A) 300B) 450C) 550D) 650E) None of the above64) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance12120231001320024150359045170A) 290B) 310C) 620D) 460E) None of the above65) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance12200133001540023300244003420035200451004630056400A) 1000B) 800C) 700D) 1100E) None of the above66) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance12100132002310024150252003415035300452504620056100A) 900B) 650C) 400D) 1200E) None of the above67) Given the following distances between
destination nodes, what is the minimum distance that connects all the nodes?FromToDistance12100135023200253001450343503540036400454504635056200A) 900B) 1200C) 1100D) 700E) None of the above68) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 4.FromNodeToNodeFluidFlow132003101215021502310032100341504350A) 100B) 150C) 200D) 50E) None of the above69) Pipeline fluid flows are indicated
below. Determine the maximum flow from Node 1 to Node 5.FromNodeToNodeFluidFlow12300210130311501420041200151005110024200422003425043300353005325045100540A) 300B) 400C) 600D) 500E) None of the above70) Find the shortest route from Node 1 to
Node 5 using the shortest-route technique.FromNodeToNodeDistance1220013150235024300342503520045150A) 350B) 400C) 450D) 600E) None of the above
