Module 8 Transportation, Assignment, and Network Algorithms

85) 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
Diff: 2
Topic: MAXIMAL-FLOW PROBLEM
AACSB: Analytic Skills
86) 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
Diff: 2
Topic: MAXIMAL-FLOW PROBLEM
AACSB: Analytic Skills
87) 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
Diff: 2
Topic: SHORTEST-ROUTE PROBLEM
AACSB: Analytic Skills
88) 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
Diff: 2
Topic: SHORTEST-ROUTE PROBLEM
AACSB: Analytic Skills
89) 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
Diff: 2
Topic: SHORTEST-ROUTE PROBLEM
AACSB: Analytic Skills
90) 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
Diff: 3
Topic: MAXIMAL-FLOW PROBLEM
AACSB: Analytic Skills
91) 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
Diff: 3
Topic: MAXIMAL-FLOW PROBLEM
AACSB: Analytic Skills
92) 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 above

-
Rating:
5/
Solution: Module 8 Transportation, Assignment, and Network Algorithms