QMB 3602
Final Exam Questions With
Reviewed Correct Answers
1. A minimum-cost flow problem has 6 supply nodes, 4
transshipment nodes, and 5 demand nodes. Each
supply node can ship to each transshipment node but
cannot ship to any demand node or to any other
supply node. Each transshipment node can ship to
each demand node, but cannot ship to any supply
node or to any other transshipment node. How many
arcs will be included in the model? ANSWER ✔ :
With 6 supply nodes, 4 transshipment nodes, and 5
demand nodes, there will be a total of 44 (6 × 4 + 4 ×
5) arcs in the model.
2. The transportation problem is a special case of
ANSWER ✔ : Minimum-Cost Flow Problems.
3. The assignment problem is a special case of
ANSWER ✔ : Minimum-Cost Flow Problems.
, 4. In a minimum-cost flow problem, which of the
following is TRUE? ANSWER ✔ :
There is at least one supply node.
There is at least one demand node.
A feasible solution will exist if and only if total supply
matches total demand.
The number of supply nodes can be different from the
number of demand nodes.
All of the answer choices are true.
5. In a distribution network, a warehouse which takes in
goods from a manufacturing site and ships goods to
customers is represented by ANSWER ✔ :
a transshipment node.
6. A firm is attempting to determine the total shipping
capacity of its supply network, which links a single
manufacturing plant to a single customer. What type
of network optimization problem is this?
ANSWER ✔ : Maximum Flow Problem
7. A travel agent is attempting to find the fastest
combination of transportation options to allow a
customer to travel from one city to another. What type
of network optimization problem is this?
ANSWER ✔ : Shortest Path Problem
Final Exam Questions With
Reviewed Correct Answers
1. A minimum-cost flow problem has 6 supply nodes, 4
transshipment nodes, and 5 demand nodes. Each
supply node can ship to each transshipment node but
cannot ship to any demand node or to any other
supply node. Each transshipment node can ship to
each demand node, but cannot ship to any supply
node or to any other transshipment node. How many
arcs will be included in the model? ANSWER ✔ :
With 6 supply nodes, 4 transshipment nodes, and 5
demand nodes, there will be a total of 44 (6 × 4 + 4 ×
5) arcs in the model.
2. The transportation problem is a special case of
ANSWER ✔ : Minimum-Cost Flow Problems.
3. The assignment problem is a special case of
ANSWER ✔ : Minimum-Cost Flow Problems.
, 4. In a minimum-cost flow problem, which of the
following is TRUE? ANSWER ✔ :
There is at least one supply node.
There is at least one demand node.
A feasible solution will exist if and only if total supply
matches total demand.
The number of supply nodes can be different from the
number of demand nodes.
All of the answer choices are true.
5. In a distribution network, a warehouse which takes in
goods from a manufacturing site and ships goods to
customers is represented by ANSWER ✔ :
a transshipment node.
6. A firm is attempting to determine the total shipping
capacity of its supply network, which links a single
manufacturing plant to a single customer. What type
of network optimization problem is this?
ANSWER ✔ : Maximum Flow Problem
7. A travel agent is attempting to find the fastest
combination of transportation options to allow a
customer to travel from one city to another. What type
of network optimization problem is this?
ANSWER ✔ : Shortest Path Problem
