Professional Documents
Culture Documents
Transportation and Assignment Models: True/False
Transportation and Assignment Models: True/False
CHAPTER 10
Transportation and Assignment Models
TRUE/FALSE
10.1 Transportation and assignment problems are really linear programming techniques called network
flow problems.
10.2 Transportation models may be used when a firm is trying to decide where to locate a new facility.
10.3 A typical transportation problem may ask the question, How many of X should be shipped to point
E from source A?
10.4 The objective of a transportation problem solution is to schedule shipments from sources to
destinations while minimizing total transportation and production costs.
10.5 In a transportation problem, each destination must be supplied by one and only one source.
10.6 In a transportation problem, a single source may supply something to all destinations.
10.7 Like the simplex method, the transportation and assignment methods are fairly simple in terms of
computation.
10.8 While the transportation and assignment algorithms have computation times that are generally 100
times faster than the simplex algorithm, the size of problems solvable on a computer is
approximately the same as when using the simplex algorithm.
10.9 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.
10.12 Using the stepping-stone method to solve a maximization problem, we would choose the route with
the largest positive improvement index.
10.13 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.
10.14 The transportation table used for transportation problems serves the same primary role as the
simplex tableau does for general linear programming problems.
10.15 Vogel's approximation method will often give a "good," if not "optimal," solution to a transportation
problem.
10.16 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.
10.18 A solution to the transportation problem can become degenerate at any iteration.
10.19 The transportation algorithm can be used to solve both minimization problems and maximization
problems.
10.20 Assignment problems involve determining the most efficient assignment of people to projects,
salesmen to territories, contracts to bidders, and so on.
10.21 The objective of an assignment problem solution most often is to minimize the total costs or time of
performing the assigned tasks.
10.22 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.
10.24 Maximization assignment problems can easily be converted to minimization problems by subtracting
each rating from the largest rating in the table.
10.25 Transportation and assignment problems can never have more than one optimal solution.
10.26 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.
MULTIPLE CHOICE
Table 10-1
To==> 1 2 3 Supply
| 3 | 6 | 4
From A 20 20 40
| 3 | 4 | 5
B 30 30
| 5 | 7 | 6
C 20 10 30
Demand 20 70 10
10.27 What is the total cost represented by the solution shown in Table 10-1?
(a) 60
(b) 2500
(c) 2600
(d) 500
(e) none of the above
10.28 What is the value of the improvement index for cell B1 shown in Table 10-1?
(a) 50
(b) +3
(c) +2
(d) +1
(e) none of the above
Table 10-2
To==> 1 2 3 Supply
| 3 | 6 | 3
From A
20 30 50
| 4 | 4 | 3
B
40 40
| 5 | 7 | 6
C
10 15 25
Demand 20 80 15
10.29 In Table 10-2, cell A3 should be selected to be filled in the next solution. If this was selected as the cell
to be filled, and the next solution was found using the appropriate stepping-stone path, how many units
would be assigned to this cell?
(a) 10
(b) 15
(c) 20
(d) 30
(e) none of the above
Table 10-3
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
80 20 100
| 6 | 7 | 4 | 0
B
120 30 150
| 10 | 9 | 6 | 0
C
170 80 250
10.30 The cell improvement indices for Table 10-3 suggest that the optimal solution has been found. Based on
this solution, how many units would actually be sent from source C?
(a) 10
(b) 170
(c) 180
(d) 250
(e) none of the above
10.31 In Table 10-3, suppose shipping cost from source C to point 2 was 8, which below would be true?
ANSWER: a {moderate, MORE THAN ONE OPTIMAL SOLUTION, AACSB: Analytic Skills}
10.32 Both transportation and assignment problems are members of a category of LP techniques called ____.
10.33 Transportation models can be used for which of the following decisions?
Table 10-6
Initial tableno allocations yet
To==> 1 2 3 Supply
| 6 | 4 | 5
From A
200
| 8 | 6 | 7
B
300
| 5 | 5 | 6
C
300
10.34 In Table 10-6, which presents a MODI solution for a transportation problem, which statement is true?
10.35 According to Table 10-6, which presents a MODI solution for a transportation problem, if that solution
is used, which of the following is true?
10.36 According to Table 10-6, which presents a MODI solution for a transportation problem, if that solution
is used, which of the following is true?
Table 10-7
Initial tableno allocations yet
To==> 1 2 3 Supply
| 4 | 6 | 4
From A 100
| 6 | 5 | 5
B 200
| 5 | 7 | 6
C 200
10.37 According to Table 10-7, which presents a MODI solution for a transportation problem, if that solution
is used, which of the following is true?
10.39 The two most common objectives for the assignment problem are the minimization of _____________.
10.40 Which of the following statements is accurate with regard to assignment problems?
10.41 Which of the following statements is true comparing the transportation and assignment algorithms to the
simplex algorithm?
(a) similar computational effort, faster, and similar computer memory usage
(b) less computational effort, similar speed, and less computer memory usage
(c) less computational effort, faster, and similar computer memory usage
(d) less computational effort, faster, and less computer memory usage
(e) similar computational effort, similar speed, and less computer memory usage
10.43 Assuming that Table 10-11 represents the results of an iteration of a transportation model,
Table 10-11
To==> 1 2 3 Suppl
| 3 | 6 | 4
Fro A
20 20 40
| 3 | 4 | 5
B
30 30
| 5 | 7 | 6
C
20 10 30
Demand 20 70 10
Table 10-12
To=> 1 2 3 Supply
From | 3 | 6 | 4
A 40 40
| 3 | 4 | 5
B 30 30
| 5 | 7 | 6
C 20 10 30
Demand 20 70 10
10.45 In Table 10-13, if cell A3 is filled on the next iteration, what is the improvement in the objective
function?
Table 10-13
To==> 1 2 3 Supply
| 3 | 6 | 3
From A
20 30 50
| 4 | 4 | 3
B
40 40
| 5 | 7 | 6
C
10 15 25
Demand 20 80 15
(a) 60
(b) 30
(c) 530
(d) 590
(e) none of the above
Table 10-14
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12
| 0
From A 80 20 100
| 6 | 7 | 4 | 0
B 120 40 30 150
| 10 | 9 | 6 | 0
C 10 170 80 250
Demand 120 80 200 100
10.48 The cell improvements shown in Table 10-15 have been calculated using the MODI method. If this is a
maximization problem, which cell should be filled next?
(a) A1
(b) A3
(c) B2
(d) C1
(e) none of the above
10.50 Which of the following is used to summarize conveniently and concisely all relevant data and to keep
track of algorithm computations?
10.51 In Table 10-17, which cell should be filled on the next iteration?
Table 10-17
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
80 20 100
| 6 | 7 | 4 | 0
B
120 30 150
| 10 | 9 | 6 | 0
C
150 100 250
(a) A1
(b) ADum
(c) B2
(d) C1
(e) C2
(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) none of the above
Table 10-18
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
80 20 100
| 6 | 7 | 4 | 0
B
120 30 150
| 10 | 9 | 6 | 0
C
170 80 250
Table 10-19
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
70 10 20 100
| 6 | 7 | 4 | 0
B
100 50 150
| 10 | 9 | 6 | 0
C
20 10 140 80 250
10.54 What is said to exist when total demand equals total supply in a transportation problem?
10.55 A company must assign mechanics to each of four jobs. The time involved varies according to
individual abilities. Table 10-21 shows how many minutes it takes each mechanic to perform each job.
If the optimal assignments are made, how many total minutes would be required for completing the
jobs?
(a) 0
(b) 4
(c) 17
(d) 16
(e) none of the above
10.56 Given Table 10-22, the final table for an assignment problem, who should be assigned to job 2?
(a) worker A
(b) worker C
(c) either worker A or worker C
(d) neither worker A nor worker C
(e) worker D
Table 10-23
To== 1 2 3 Supply
| 6 | 4 | 5
From A 200
| 8 | 6 | 7
B 300
| 5 | 5 | 6
C 300
10.57 Table 10-23 provides information about a transportation problem. This problem is
(a) unbounded.
(b) unbalanced.
(c) infeasible.
(d) all of the above
(e) none of the above
Table 10-24
To==> 1 2 3
Dummy Supply
| 6 | 4 | 0 | 5
From A 200 200
| 8 | 6 | 7 | 0
B 100 100 100 300
| 5 | 5 | 6 | 0
C 300 300
10.58 According to Table 10-24, which presents a solution to a transportation problem obtained by Vogel's
approximation, which of the following is true?
10.59 Which technique requires that we start in the upper-left-hand cell of the table and allocate units to
shipping routes in a stair step fashion?
10.60 Which of the following accurately describes steps of the northwest corner rule, after making the initial
allocation of units in the northwest cell?
10.61 Which of the following accurately describes steps in the transportation algorithm?
(a) Compute an improvement index using either the stepping-stone method or the MODI method.
If a better solution is possible, use the MODI method to reallocate units.
(b) Compute an improvement index using either the stepping-stone method or Vogels
approximation method. If a better solution is possible, use the stepping-stone method to
reallocate units.
(c) Compute an improvement index using either the stepping-stone method or Vogels
approximation method. If a better solution is possible, use Vogels approximation method to
reallocate units.
(d) Compute an improvement index using either the stepping-stone method or the MODI method.
If a better solution is possible, use the stepping-stone method to reallocate units.
(e) Compute an improvement index using either the MODI method or Vogels approximation
method. If a better solution is possible, use the MODI method to reallocate units.
10.62 When using the stepping-stone method, what is the maximum amount that can be shipped on the new
route?
(a) the smallest number found in the squares with minus signs
(b) the smallest number found in the squares with plus signs
(c) the smallest number along the closed path
(d) the minimum of the demand requirement for that column and the supply capacity for that row
(e) the largest number found on the squares with minus signs
10.63 Which of the following statements is true regarding the MODI method?
Table 10-27
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
80 80
| 6 | 7 | 4 | 0
B
120 30 150
| 10 | 9 | 6 | 0
C
170 80 250
(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) both b and d
Table 10-28
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
80 20 100
| 6 | 7 | 4 | 0
B
100 50 150
| 10 | 9 | 6 | 0
C
20 150 80 250
(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) none of the above
Table 10-29
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
40 10 50
| 6 | 7 | 4 | 0
B
60 15 75
| 10 | 9 | 6 | 0
C
85 40 125
Demand 60 40 100 50
(a) infeasible.
(b) one of a number of alternate solutions.
(c) unbounded.
(d) optimal.
(e) none of the above
10.67 A certain firm has four different operations that must be assigned to four locations. The profit (in
thousands of dollars) associated with each operation at each location is presented below. The firm's vice
president would like to assign the various operations so that the total profit is maximized. Find the
appropriate assignments.
Table 10-30
Operations Location
1 2 3 4
W 9 11 7 10
X 10 12 6 12
Y 8 10 13 9
Z 12 8 11 10
10.68 Given Table 10-31, the final table for an assignment problem, which assignment would you make first?
(a) worker A
(b) worker B
(c) worker C
(d) Either worker B or worker C
(e) Either worker A or worker C
10.69 At each iteration of the MODI method, which of the following must occur?
10.71 Which of the following techniques can be used for moving from an initial feasible solution to an optimal
solution in a transportation problem?
10.72 Which of the following is an applicable characteristic in using the stepping-stone method?
10.73 After testing each unused cell by the stepping-stone method in the transportation problem and finding
only one cell with a negative improvement index,
(a) once you make that improvement, you would definitely have an optimal solution.
(b) you would make that improvement and then check all unused cells again.
(c) you could stop because you already had the optimal solution.
(d) you should check to be sure that you don't have to add a dummy source or dummy destination.
(e) none of the above
10.75 In using the stepping-stone or the MODI solution method, which of the following rules must first be
observed in order to apply the method?
10.76 Which method usually gives a very good initial solution and often results in the optimal solution to a
transportation problem?
10.77 In applying Vogel's approximation method to a cost minimization problem, row and column penalties
are determined by
10.78 If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation
problem, we will use the
10.79 Why does Vogels approximation method tend to find a good initial solution to the transportation
problem?
10.80 When the solution of a transportation problem by Vogel's approximation method is done, we know that
10.81 If the total supply from the sources does not equal the total demand from the destinations in the
transportation problem,
(a) the number of used (or full) cells does not equal the number of rows plus columns minus one.
(b) in an initial solution, both a row total and a column total are satisfied simultaneously.
(c) during an improvement, two negative cells contain the same smallest amount.
(d) all of the above
(e) none of the above
10.83 To apply Vogels approximation method, first compute for each row and column the penalty faced if we
should ship over ________________________________________________.
10.85 Which of the following is not a step in the Hungarian method of assignment?
10.86 Why dont we want to use the transportation algorithm to solve the assignment problem?
10.88 In revising the opportunity cost table of the assignment problem, after drawing lines through all of the
zeros
10.89 Which of the following methods is used only with the assignment problem?
(a) just reverse all the decision rules used in the minimizing algorithm (if it says subtract, now
add, and so on).
(b) convert the problem to an equivalent minimization problem.
(c) use the Australian transformation process and convert the data.
(d) all of the above
(e) none of the above
Table 10-34
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
50
| 6 | 7 | 4 | 0
B
75
| 10 | 9 | 6 | 0
C
125
Demand 60 40 100 50
(a)
Table 10-34 a
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
40 10 50
| 6 | 7 | 4 | 0
B
60 15 75
| 10 | 9 | 6 | 0
C
85 40 125
Demand 60 40 100 50
(b)
Table 10-34 b
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
20 30 50
| 6 | 7 | 4 | 0
B
60 15 75
| 10 | 9 | 6 | 0
C
20 85 20 125
Demand 60 40 100 50
(c)
Table 10-34 c
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
40 10 50
| 6 | 7 | 4 | 0
B
15 25 35 75
| 10 | 9 | 6 | 0
C
20 100 5 125
Demand 60 40 100 50
(d)
Table 10-34 d
To==> 1 2 3 Dummy Supply
| 10 | 8 | 12 | 0
From A
50 50
| 6 | 7 | 4 | 0
B
75 75
| 10 | 9 | 6 | 0
C
10 40 25 50 125
Demand 60 40 100 50
Table 10-35
To==> 1 2 3 Dummy Supply
| 5 | 8 | 8 | 0
From A
50 40
| 6 | 9 | 4 | 0
B
75 85
| 6 | 9 | 6 | 0
C
10 40 25 50 110
Demand 50 60 85 40
(a)
Table 10-35a Solution?
To==> 1 2 3 Dummy Supply
| 5 | 8 | 8 | 0
From A
50 40
| 6 | 9 | 4 | 0
B
75 85
| 6 | 9 | 6 | 0
C
10 40 25 50 110
Demand 50 60 85 40
(b)
Table 10-35b Solution?
To==> 1 2 3 Dummy Supply
| 5 | 8 | 8 | 0
From A
50 40
| 6 | 9 | 4 | 0
B
75 85
| 6 | 9 | 6 | 0
C
10 40 25 50 110
Demand 50 60 85 40
(c)
Table 10-35c Solution?
To==> 1 2 3 Dummy Supply
| 5 | 8 | 8 | 0
From A
40 40
| 6 | 9 | 4 | 0
B
10 60 15 85
| 6 | 9 | 6 | 0
C
70 40 110
Demand 50 60 85 40
(d)
Table 10-35d Solution?
To==> 1 2 3 Dummy Supply
| 5 | 8 | 8 | 0
From A
40 40
| 6 | 9 | 4 | 0
B
85 85
| 6 | 9 | 6 | 0
C
50 60 110
Demand 50 60 85 40
10.94 Use Vogels approximation to find the solution to the transportation problem shown in Table 10-36.
Table 10-36
To==> 1 2 3 Dummy Supply
| 5 | 7 | 8 | 0
From A
20
| 3 | 9 | 9 | 0
B
65
5 | 9 | 6 | 0
C
90
Demand 30 40 85 20
(a)
Table 10-36a Solution?
To==> 1 2 3 Dummy Supply
| 5 | 7 | 8 | 0
From A
20 20
| 3 | 9 | 9 | 0
B 65
65
|5 | 9 | 6 | 0
C 30 40 20
90
Demand 30 40 85 20
(b)
Table 10-36b Solution?
To==> 1 2 3 Dummy Supply
| 5 | 7 | 8 | 0
From A 20
20
| 3 | 9 | 9 | 0
B 30 35
65
|5 | 9 | 6 | 0
C 20 50 20
90
Demand 30 40 85 20
(c)
Table 10-36c Solution?
To==> 1 2 3 Dummy Supply
| 5 | 7 | 8 | 0
From A
20 20
| 3 | 9 | 9 | 0
B
30 15 20 65
5 | 9 | 6 | 0
C
5 85 90
Demand 30 40 85 20
(d)
Table 10-36d Solution?
To==> 1 2 3 Dummy Supply
| 5 | 7 | 8 | 0
From A
10 10 20
| 3 | 9 | 9 | 0
B
40 5 65
5 | 9 | 6 | 0
C
85 5 90
Demand 30 40 85 20
10.95 The table below describes a transportation problem. Find the solution to this problem using Vogels
approximation.
Table 10-37
To==> 1 2 3 4 Supply
| 4 | 7 | 10 | 12 2000
From A
| 7 | 5 | 8 | 11
B
2500
9 | 8 | 6 10
C
2200
(a)
(a) Table 10-37a Solution?
To==> 1 2 3 4 Supply
| 4 | 7 | 10 | 12 2000
From A
1000 1000
| 7 | 5 | 8 | 11
B
1000 300 1200 2500
9 | 8 | 6 | 10
C
1200 1000 2200
(b)
Table 10-37b Solution?
To==> 1 2 3 4 Supply
| 4 | 7 | 10 | 12
From A
200 800 1200 2000
| 7 | 5 | 8 | 11
B 1000
1500 2500
9 | 8 | 6 | 10
C
2000 200 2200
(c)
Table 10-37c Solution?
To==> 1 2 3 4 Supply
| 4 | 7 | 10 | 12
From A
2000 2000
| 7 | 5 | 8 | 11
B
1000 300 1200 2500
9 | 8 | 6 | 10
C
200 1800 2200
(d)
Table 10-37d Solution?
To==> 1 2 3 4 Supply
| 4 | 7 | 10 | 12
From A
1000 1000 2000
| 7 | 5 | 8 | 11
B
2200 100 200 2500
9 | 8 | 6 | 10
C
2200 2200
PROBLEMS
Table 10-38
To==> D E F Supply
| 2 | 5 | 2
From A 40
| 1 | 4 | 2
B 30
| 4 | 3 | 2
C 30
Demand 20 30 50 100
ANSWER: (a)
To==> D E F Supply
| 2 | 5 | 2
From A 20 20 40
| 1 | 4 | 2
B 10 20 30
| 4 | 3 | 2
C 30 30
Demand 20 30 50 100
To==> D E F Supply
| 2 | 5 | 2
From A 40 40
| 1 | 4 | 2
B 20 10 30
| 4 | 3 | 2
C 30 30
Demand 20 30 50 100
10.97 Four projects must be completed, and each of four employees will be assigned to work on exactly one of
the four projects. The table below presents an estimate of the cost that each employee would incur if
working on the respective projects. What is the minimum-cost assignment of workers to projects?
PROJECT
EMPLOYEE 1 2 3 4
Mary $45 $32 $49 $55
Elizabeth $50 $45 $53 $43
Steven $52 $40 $70 $46
Joshua $60 $35 $40 $40
SHORT ANSWER/ESSAY
ANSWER: a specific case of linear programming concerned with scheduling shipments from
sources to destinations while minimizing transportation costs {moderate, INTRODUCTION}
ANSWER: a situation in which total demand equals total supply exactly {moderate, SETTING UP
A TRANSPORTATION PROBLEM}
10.100 The assignment problem is a special case of the transportation problem. So, then, why is it not
recommended to use the transportation algorithm to solve the assignment problem?