Chapter 9 Transportation and Assignment Models.
1) Transportation and assignment problems are really linear programming techniques called network
flow problems.
Answer: TRUE
Diff:2Topic: INTRODUCTION
2) Transportation models may be used when a firm is trying to decide where to locate a new facility.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
3) A typical transportation problem may ask the question, "How many of X should be shipped to point E
from source A?"
Answer: TRUE
Diff: 1Topic: THE TRANSPORTATION ALGORITHM
4) The objective of a transportation problem solution is to schedule shipments from sources to
destinations while minimizing total transportation and production costs.
Answer: TRUE
Diff: 1Topic: THE TRANSPORTATION ALGORITHM
5) In a transportation problem, each destination must be supplied by one and only one source.
Answer: FALSE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
6) In a transportation problem, a single source may supply something to all destinations.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
7) In finding the maximum quantity that can be shipped on the least costly route using the stepping-
stone method, one examines the closed path of plus and minus signs drawn and selects the smallest
number found in those squares containing minus signs.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
8) In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.
Answer: FALSE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
9) Using the stepping-stone method to solve a maximization problem, we would choose the route with
the largest positive improvement index.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
10) One of the advantages of the stepping-stone method is that if, at a particular iteration, we
accidentally choose a route that is not the best, the only penalty is to perform additional iterations.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
11) A "balanced problem" exists in a transportation model when the optimal solution has the same
amount being shipped over all paths that have any positive shipment.
Answer: FALSE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
12) It is possible to find an optimal solution to a transportation problem that is degenerate.
Answer: TRUE
Diff: 2Topic: SPECIAL SITUATIONS WITH THE TRANSPORTATION ALGORITHM
13) A solution to the transportation problem can become degenerate at any iteration.
Answer: TRUE
Diff: 2Topic: SPECIAL SITUATIONS WITH THE TRANSPORTATION ALGORITHM
14) The transportation algorithm can be used to solve both minimization problems and maximization
problems.
Answer: TRUE
Diff: 2Topic: THE TRANSPORTATION ALGORITHM
15) Assignment problems involve determining the most efficient assignment of people to projects,
salesmen to territories, contracts to bidders, and so on.
Answer: TRUE
Diff: 1Topic: THE ASSIGNMENT ALGORITHM
16) The objective of an assignment problem solution most often is to minimize the total costs or time of
performing the assigned tasks.
Answer: TRUE
Diff: 2Topic: THE ASSIGNMENT ALGORITHM
17) In the assignment problem, the costs for a dummy row will be equal to the lowest cost of the
column for each respective cell in that row.
Answer: FALSE
Diff: 2Topic: THE ASSIGNMENT ALGORITHM
18) The Hungarian method is designed to solve transportation problems efficiently.
Answer: FALSEDiff: 2Topic: THE ASSIGNMENT ALGORITHM
19) Maximization assignment problems can easily be converted to minimization problems by subtracting
each rating from the largest rating in the table.
Answer: TRUE
Diff: 2Topic: THE ASSIGNMENT ALGORITHM
20) In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a
dummy source is given a very high cost.
Answer: FALSE