QMB 3602 EXAM 3 QUESTIONS AND
ANSWERS
A minimum-cost flow problem has 6 supply nodes, 0 transshipment
nodes, and 6 demand nodes. If each supply node can ship to every
demand node, how many arcs will be included in the model? -
correct answer ✅36 numbers of arcs
(6 x 0 + 0 x 6)
36
The transportation problem is a special case of...
A. Shortest Path Problems.
B. Minimum-Cost Flow Problems.
C. Maximum Flow Problems.
D. Maximum-Cost Flow Problems.
E. Minimum Flow Problems. -
correct answer ✅B. Minimum-Cost Flow Problems.
,QMB 3602 EXAM 3 QUESTIONS AND
ANSWERS
The assignment problem is a special case of...
A. Maximum Flow Problems.
B. Minimum Flow Problems.
C. Shortest Path Problems.
D. Maximum-Cost Flow Problems.
E. Minimum-Cost Flow Problems. -
correct answer ✅E. Minimum-Cost Flow Problems.
In a minimum-cost flow problem, which of the following is TRUE?
A. There is at least one supply node.
B. There is at least one demand node.
, QMB 3602 EXAM 3 QUESTIONS AND
ANSWERS
C. A feasible solution will exist if and only if total supply matches
total demand.
D. The number of supply nodes can be different from the number
of demand nodes.
E. All of the answer choices are true. -
correct answer ✅D. All of the answer choices are true.
In a distribution network, a warehouse which takes in goods from a
manufacturing site and ships goods to customers is represented
by...
A. A demand node.
B. A source.
C. A supply node.
D. A sink.
ANSWERS
A minimum-cost flow problem has 6 supply nodes, 0 transshipment
nodes, and 6 demand nodes. If each supply node can ship to every
demand node, how many arcs will be included in the model? -
correct answer ✅36 numbers of arcs
(6 x 0 + 0 x 6)
36
The transportation problem is a special case of...
A. Shortest Path Problems.
B. Minimum-Cost Flow Problems.
C. Maximum Flow Problems.
D. Maximum-Cost Flow Problems.
E. Minimum Flow Problems. -
correct answer ✅B. Minimum-Cost Flow Problems.
,QMB 3602 EXAM 3 QUESTIONS AND
ANSWERS
The assignment problem is a special case of...
A. Maximum Flow Problems.
B. Minimum Flow Problems.
C. Shortest Path Problems.
D. Maximum-Cost Flow Problems.
E. Minimum-Cost Flow Problems. -
correct answer ✅E. Minimum-Cost Flow Problems.
In a minimum-cost flow problem, which of the following is TRUE?
A. There is at least one supply node.
B. There is at least one demand node.
, QMB 3602 EXAM 3 QUESTIONS AND
ANSWERS
C. A feasible solution will exist if and only if total supply matches
total demand.
D. The number of supply nodes can be different from the number
of demand nodes.
E. All of the answer choices are true. -
correct answer ✅D. All of the answer choices are true.
In a distribution network, a warehouse which takes in goods from a
manufacturing site and ships goods to customers is represented
by...
A. A demand node.
B. A source.
C. A supply node.
D. A sink.
