You are on page 1of 35

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.


218
CHAPTER 10
Transportation and Assignment Models

TRUE/FALSE

10.1 Transportation and assignment problems are really linear programming techniques called network
flow problems.

ANSWER: TRUE {moderate, INTRODUCTION}

10.2 Transportation models may be used when a firm is trying to decide where to locate a new facility.

ANSWER: TRUE {moderate, INTRODUCTION}

10.3 A typical transportation problem may ask the question, How many of X should be shipped to point
E from source A?

ANSWER: TRUE {easy, INTRODUCTION}

10.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 {easy, INTRODUCTION}

10.5 In a transportation problem, each destination must be supplied by one and only one source.

ANSWER: FALSE {moderate, INTRODUCTION}

10.6 In a transportation problem, a single source may supply something to all destinations.

ANSWER: TRUE {moderate, INTRODUCTION}

10.7 Like the simplex method, the transportation and assignment methods are fairly simple in terms of
computation.

ANSWER: FALSE {moderate, INTRODUCTION}

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.

ANSWER: FALSE {moderate, INTRODUCTION}

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.

ANSWER: TRUE {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}

Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

219

10.10 Another name for the MODI method is Floods technique.

ANSWER: FALSE {moderate, INTRODUCTION}
10.11 In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.

ANSWER: FALSE {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}

10.12 Using the stepping-stone method to solve a maximization problem, we would choose the route with
the largest positive improvement index.

ANSWER: TRUE {moderate, MAXIMIZATION TRANSPORTATION PROBLEMS}

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.

ANSWER: TRUE {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}

10.14 The transportation table used for transportation problems serves the same primary role as the
simplex tableau does for general linear programming problems.

ANSWER: TRUE {moderate, SETTING UP A TRANSPORTATION PROBLEM }

10.15 Vogel's approximation method will often give a "good," if not "optimal," solution to a transportation
problem.

ANSWER: TRUE {moderate, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO
FIND AN INITIAL SOLUTION}

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.

ANSWER: FALSE {moderate, SETTING UP A TRANSPORTATION PROBLEM}

10.17 It is possible to find an optimal solution to a transportation problem that is degenerate.

ANSWER: TRUE {moderate, DEGENERACY IN TRANSPORTATION PROBLEMS}

10.18 A solution to the transportation problem can become degenerate at any iteration.

ANSWER: TRUE {moderate, DEGENERACY IN TRANSPORTATION PROBLEMS}

10.19 The transportation algorithm can be used to solve both minimization problems and maximization
problems.

ANSWER: TRUE {moderate, MAXIMIZATION TRANSPORTATION PROBLEMS}


Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
220
10.20 Assignment problems involve determining the most efficient assignment of people to projects,
salesmen to territories, contracts to bidders, and so on.

ANSWER: TRUE {easy, INTRODUCTION}

10.21 The objective of an assignment problem solution most often is to minimize the total costs or time of
performing the assigned tasks.

ANSWER: TRUE {moderate, INTRODUCTION}

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.

ANSWER: FALSE {moderate, UNBALANCED ASSIGNMENT PROBLEMS}

10.23 The Hungarian method is designed to solve transportation problems efficiently.

ANSWER: FALSE {moderate, ASSIGNMENT MODEL APPROACH}

10.24 Maximization assignment problems can easily be converted to minimization problems by subtracting
each rating from the largest rating in the table.

ANSWER: TRUE {moderate, MAXIMIZATION ASSIGNMENT PROBLEMS}

10.25 Transportation and assignment problems can never have more than one optimal solution.

ANSWER: FALSE {moderate, 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.

ANSWER: FALSE {moderate, UNBALANCED TRANSPORTATION PROBLEMS and
UNBALANCED ASSIGNMENT PROBLEMS}


MULTIPLE CHOICE

Table 10-1
To==> 1 2 3 Supply

From

A
| 3
20
| 6
20
| 4


40

B
| 3

| 4
30
| 5


30

C
| 5

| 7
20
| 6
10

30
Demand 20 70 10


Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

221

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

ANSWER: d {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE, AACSB: Analytic Skills}

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

ANSWER: c {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}


Table 10-2
To==> 1 2 3 Supply

From

A

| 3

20
| 6

30
| 3



50

B
| 4

| 4

40
| 3



40

C
| 5


| 7

10
| 6

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

ANSWER: b {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
222

Table 10-3
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

80
| 12

| 0

20


100

B
| 6

120
| 7


| 4

30
| 0



150

C
| 10


| 9


| 6

170
| 0

80


250

Demand

120

80

200

100


The following cell improvements are
provided for Table 10-3
Cell Improvement Index
A1 +2
A3 +6
B2 +1
B-Dummy +2
C1 +2
C2 +1

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

ANSWER: b {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}


10.31 In Table 10-3, suppose shipping cost from source C to point 2 was 8, which below would be true?

(a) There would be multiple optimal solutions.
(b) The minimum possible total cost would decrease.
(c) The minimum possible total cost would increase.
(d) Another dummy column would be needed.
(e) none of the above

ANSWER: a {moderate, MORE THAN ONE OPTIMAL SOLUTION, AACSB: Analytic Skills}

Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

223

10.32 Both transportation and assignment problems are members of a category of LP techniques called ____.

(a) transasignment problems
(b) Hungarian problems
(c) source-destination problems
(d) supply and demand problems
(e) Network flow problems

ANSWER: e {moderate, INTRODUCTION}

10.33 Transportation models can be used for which of the following decisions?

(a) facility location
(b) production mix
(c) media selection
(d) portfolio selection
(e) employee shift scheduling

ANSWER: a {easy, INTRODUCTION}

Table 10-6
Initial tableno allocations yet
To==> 1 2 3 Supply

From

A

| 6


| 4


| 5



200


B
| 8

| 6


| 7



300


C
| 5


| 5


| 6




300


Demand

400

200

100


Optimal Solution by the Modi Method
To==> 1 2 3 Dummy Supply

From

A

| 6

100
| 4


| 5

100
| 0




200

B
| 8


| 6

200
| 7


| 0

100


300

C
| 5

300
| 5


| 6


| 0




300

Demand

400

200

100

100


Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
224
10.34 In Table 10-6, which presents a MODI solution for a transportation problem, which statement is true?

(a) There is no feasible solution to the problem.
(b) The total cost represented by the solution is $3,700.
(c) One hundred units of demand are not met.
(d) The original problem was unbalanced.
(e) The cheapest route has the highest shipment amount.

ANSWER: d {moderate, UNBALANCED TRANSPORTATION PROBLEMS, AACSB: Analytic
Skills}

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?

(a) Source A will ship 200 units to destination 1.
(b) Source B will ship only 200 units.
(c) Source C will ship only 200 units.
(d) Source A will ship 100 units to destination 2.
(e) none of the above

ANSWER: b {moderate, UNBALANCED TRANSPORTATION PROBLEMS, AACSB: Analytic
Skills}

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?

(a) Total cost of shipping from A is $1,000.
(b) Total cost of shipping from B is $1,200.
(c) Total cost of shipping from C is $300.
(d) Total cost of shipping from B is $1,300.
(e) none of the above

ANSWER: b {moderate, UNBALANCED TRANSPORTATION PROBLEMS, AACSB: Analytic
Skills}

















Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

225

Table 10-7
Initial tableno allocations yet
To==> 1 2 3 Supply

From

A
| 4

| 6

| 4


100

B
| 6

| 5

| 5


200

C
| 5

| 7

| 6


200

Demand

200

200

100



Optimal solution by the MODI method
To==> 1 2 3 Supply

From

A

| 4


| 6


| 4

100


100

B
| 6


| 5

200
| 5




200

C
| 5

200
| 7


| 6




200

Demand

200

200

100


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?

(a) 100 units will be shipped from source A to destination 1.
(b) The total cost is $500.
(c) The final solution is degenerate.
(d) The original problem was unbalanced.
(e) none of the above

ANSWER: c {moderate, DEGENERACY IN TRANSPORTATION PROBLEMS, AACSB:
Analytic Skills}
10.38 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?

(a) The total shipping cost is $2,400.
(b) There is excess supply.
(c) There is excess demand.
(d) The total cost of shipping is $500.
(e) none of the above

ANSWER: a {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
226

10.39 The two most common objectives for the assignment problem are the minimization of _____________.

(a) uncertainty or inexperience
(b) total costs or inexperience
(c) total costs or total time
(d) total time or inexperience
(e) total costs or uncertainty

ANSWER: c {moderate, INTRODUCTION}

10.40 Which of the following statements is accurate with regard to assignment problems?

(a) A project can be assigned to more than one person.
(b) Only one person can be assigned to each project.
(c) A person can be assigned to more than one project.
(d) (a) and (c)
(e) none of the above

ANSWER: b {moderate, INTRODUCTION}

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

ANSWER: d {easy, INTRODUCTION}

10.42 Which of the following are synonyms?

(a) Hungarian method, Floods technique, and reduced matrix method
(b) Hungarian method, MODI, and Vogels approximation method
(c) northwest corner rule, MODI, and reduced matrix method
(d) stepping-stone method, reduced matrix method, and northwest corner rule
(e) Hungarian method, Floods technique, and northwest corner rule

ANSWER: a {moderate, INTRODUCTION}

Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

227

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

Fro

A

| 3

20
| 6

20
| 4



40

B
| 3

| 4

30
| 5



30

C
| 5


| 7

20
| 6

10


30
Demand 20 70 10

The next tableau will be:

Answer (a) Answer (b)
To=> 1 2 3 Supply To=> 1 2 3 Supply
From
A

| 3


| 6

40
| 4




40
From
A

| 3

20
| 6

10
| 4

10


40

B
| 3

| 4

30
| 5



30

B
| 3

| 4

30
| 5



30

C
| 5

20
| 7


| 6

10


30

C
| 5


| 7

30
| 6




30
Demand 20 70 10 Demand 20 70 10

Answer (c) Answer (d)
To=> 1 2 3 Supply To=> 1 2 3 Supply
From
A

| 3

20
| 6

20
| 4



40
From
A

| 3


| 6

40
| 4



40

B
| 3

| 4

20
| 5

10


30

B
| 3

20
| 4

10
| 5



30

C
| 5


| 7

30
| 6




30

C
| 5


| 7

20
| 6

10


30
Demand 20 70 10 Demand 20 70 10

(e) none of the above

ANSWER: b {hard, STEPPING-STONE METHOD: FINDING A LEAST-COST SOLUTION,
AACSB: Analytic Skills}

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
228

Table 10-12

To=> 1 2 3 Supply
From
A
| 3

| 6
40
| 4


40

B
| 3

| 4
30
| 5


30

C
| 5
20
| 7

| 6
10

30
Demand 20 70 10

10.44 Table 10-12 represents a solution that is

(a) clearly optimal for a minimization objective.
(b) degenerate.
(c) infeasible.
(d) all of the above
(e) none of the above

ANSWER: b {moderate, DEGENERACY IN TRANSPORTATION PROBLEMS, AACSB:
Analytic Skills}

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

From

A

| 3

20
| 6

30
| 3



50

B
| 4

| 4

40
| 3



40

C
| 5


| 7

10
| 6

15


25

Demand

20

80

15


(a) 60
(b) 30
(c) 530
(d) 590
(e) none of the above

ANSWER: b {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}


Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

229

10.46 A transportation problem

(a) is a special case of the linear programming problem.
(b) can be solved by linear programming, but is solved more efficiently by a special-purpose
algorithm.
(c) may give an initial feasible solution rather than the optimal solution.
(d) requires the same assumptions that are required for linear programming problems.
(e) all of the above

ANSWER: e {moderate, various}

Table 10-14
To==> 1 2 3 Dummy Supply

From

A
| 10

| 8
80
| 12

| 0
20

100

B
| 6
120
| 7
40
| 4
30
| 0


150

C
| 10

| 9
10
| 6
170
| 0
80

250
Demand 120 80 200 100

10.47 Table 10-14 illustrates a(n)

(a) optimal solution.
(b) degenerate solution.
(c) unbounded solution.
(d) infeasible solution.
(e) none of the above

ANSWER: d {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE, AACSB: Analytic Skills}
Table 10-15
Cell Improvement Indices
A1 +2
A3 +6
B2 +1
B-Dummy +2
C1 +2
C2 +1









Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
230
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

ANSWER: b {moderate, MAXIMIZATION TRANSPORTATION PROBLEMS, AACSB:
Analytic Skills}
10.49 The only restriction we place on the initial solution of a transportation problem is that

(a) we must have nonzero quantities in a majority of the boxes.
(b) all constraints must be satisfied.
(c) demand must be less than supply.
(d) we must have a number (equal to the number of rows plus the number of columns minus one)
of boxes that contain nonzero quantities.
(e) none of the above

ANSWER: b {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE}

10.50 Which of the following is used to summarize conveniently and concisely all relevant data and to keep
track of algorithm computations?

(a) source-destination matrix
(b) Hungarian table
(c) stepping-stone grid
(d) transportation table
(e) tabulation report

ANSWER: d {moderate, SETTING UP A TRANSPORTATION PROBLEM}


















Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

231

10.51 In Table 10-17, which cell should be filled on the next iteration?

Table 10-17
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

80
| 12

20
| 0




100

B
| 6

120
| 7


| 4

30
| 0



150

C
| 10


| 9


| 6

150
| 0

100


250

Demand

120

80

200

100


(a) A1
(b) ADum
(c) B2
(d) C1
(e) C2

ANSWER: b {hard, MODI METHOD, AACSB: Analytic Skills}

10.52 The solution presented in Table 10-18 is

(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) none of the above

ANSWER: d {hard, STEPPING-STONE METHOD: FINDING A LEAST-COST SOLUTION,
AACSB: Analytic Skills}

Table 10-18
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

80
| 12

| 0

20


100

B
| 6

120
| 7


| 4

30
| 0



150

C
| 10


| 9


| 6

170
| 0

80


250

Demand

120

80

200

100


Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
232
10.53 What is wrong with Table 10-19?

Table 10-19
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

70
| 12

10
| 0

20


100

B
| 6

100
| 7


| 4

50
| 0



150

C
| 10

20
| 9

10
| 6

140
| 0

80


250

Demand

120

80

200

100



(a) The solution is infeasible.
(b) The solution is degenerate.
(c) The solution is unbounded.
(d) Nothing is wrong.
(e) There are too many filled cells.

ANSWER: e {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION, AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

233

10.54 What is said to exist when total demand equals total supply in a transportation problem?

(a) an equalized problem
(b) an equilibrialized problem
(c) a harmonized problem
(d) a balanced problem
(e) This situation can never occur.

ANSWER: d {easy, SETTING UP A TRANSPORTATION PROBLEM}


Table 10-21 Job (Time in Minutes)
1 2 3 4
Worker A 5 9 5 7
B 3 8 4 4
C 5 5 8 4
D 7 4 5 5

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

ANSWER: d {hard, ASSIGNMENT MODEL APPROACH, AACSB: Analytic Skills}

Table 10-22 Job (Time in Minutes)
1 2 3 4
Worker A 0 0 2 1
B 1 3 1 0
C 1 0 1 1
D 0 1 0 3

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

ANSWER: b {moderate, ASSIGNMENT MODEL APPROACH, AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
234

Table 10-23
To== 1 2 3 Supply

From

A
| 6

| 4

| 5


200


B
| 8

| 6

| 7


300


C
| 5

| 5

| 6


300


Demand

400

200

100


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

ANSWER: (b) {moderate, UNBALANCED TRANSPORTATION PROBLEMS, AACSB:
Analytic Skills}


Table 10-24
To==> 1 2 3 Dummy Supply

From

A
| 6

| 4
200
| 5

| 0


200

B
| 8
100
| 6

| 7
100
| 0
100

300

C
| 5
300
| 5

| 6

| 0


300

Demand

400

200

100

100



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?

(a) The solution is degenerate.
(b) The total cost represented by the solution is 3,800.
(c) The original problem was unbalanced.
(d) all of the above
(e) none of the above

ANSWER: d {moderate, various, AACSB: Analytic Skills}



Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

235


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?

(a) upper-left rule
(n) stair step method
(c) northwest corner rule
(d) Vogels approximation method
(e) MODI

ANSWER: c {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE}

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?

(a) Move down first, and then move right.
(b) Move right first, and then move down.
(c) Move right or down first, depending on whether the demand requirement or the supply
capacity, respectively, is exhausted first.
(d) Move right or down first, depending on whether the supply capacity or the demand
requirement, respectively, is exhausted first.
(e) Move diagonally first.

ANSWER: c {hard, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER RULE}

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.

ANSWER: d {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE}

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
236
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

ANSWER: a {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}

10.63 Which of the following statements is true regarding the MODI method?

(a) Both R and K values must be positive.
(b) Both R and K values cannot be negative.
(c) Both R and K values cannot be 0.
(d) The R values must be positive, and the K values must be negative.
(e) Both R and K values can be 0 or negative

ANSWER: e {moderate, MODI METHOD}

Table 10-27
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

80
| 12

| 0




80

B
| 6

120
| 7


| 4

30
| 0



150

C
| 10


| 9


| 6

170
| 0

80


250

Demand

120

80

200

80



10.64 The solution presented in Table 10-27 is

(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) both b and d

ANSWER: e {hard, various, AACSB: Analytic Skills}




Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

237


Table 10-28
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

80
| 12


| 0

20


100

B
| 6

100
| 7


| 4

50
| 0



150

C
| 10

20
| 9


| 6

150
| 0

80


250

Demand

120

80

200

100


10.65 The solution shown in Table 10-28 is

(a) infeasible.
(b) degenerate.
(c) unbounded.
(d) optimal.
(e) none of the above

ANSWER: e {hard, various, AACSB: Analytic Skills}


Table 10-29
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

40
| 12


| 0

10


50

B
| 6

60
| 7


| 4

15
| 0



75

C
| 10


| 9


| 6

85
| 0

40


125

Demand

60

40

100

50


10.66 The solution shown in Table 10-29 is

(a) infeasible.
(b) one of a number of alternate solutions.
(c) unbounded.
(d) optimal.
(e) none of the above

ANSWER: d {hard, STEPPING STONE METHOD: FINDING THE LEAST-COST SOLUTION,
AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
238
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

ANSWER: Assign W to 2, X to 4, Y to 3, and Z to 1. Total profit = $48 (thousand)
{hard, ASSIGNMENT MODEL APPROACH and MAXIMIZATION ASSIGNMENT
PROBLEMS, AACSB: Analytic Skills}

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

ANSWER: e {moderate, ASSIGNMENT MODEL APPROACH, AACSB: Analytic Skills}

Table 10-31 Job (Time in Minutes)
1 2 3 4
Worker A 0 1 2 3
B 0 0 0 1
C 2 2 5 0
D 4 0 0 2

10.69 At each iteration of the MODI method, which of the following must occur?

(a) A linear program must be solved.
(b) Vogels approximation method must be employed.
(c) A system of simultaneous equations must be solved.
(d) The northwest corner method must be employed.
(e) The Hungarian method must be employed.

ANSWER: c {moderate, MODI method}

Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

239

10.70 What does VAM stand for?

(a) variance approximation method
(b) variable assignment method
(c) vector approximation method
(d) Vogels approximation method
(e) Van Austin method

ANSWER: d {easy, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND AN
INITIAL SOLUTION}

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?

(a) Hungarian method
(b) stepping-stone method
(c) northwest corner rule
(d) Vogel's approximation method
(e) all of the above

ANSWER: b {moderate, STEPPING STONE METHOD: FINDING A LEAST-COST
SOLUTION}

10.72 Which of the following is an applicable characteristic in using the stepping-stone method?

(a) Only an unoccupied square may be used as a "stepping-stone."
(b) Only an occupied square may be used as a "stepping-stone."
(c) Only the column and row with the highest factory capacity may be used as a "stepping-stone."
(d) all of the above
(e) none of the above

ANSWER: b {moderate, STEPPING STONE METHOD: FINDING A LEAST-COST
SOLUTION}

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

ANSWER: b {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}


Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
240
10.74 In the transportation problem, using the stepping-stone method,

(a) you may not skip over an empty cell.
(b) you may not skip over a used cell.
(c) your path may not cross over itself.
(d) if you have an optimal solution and get an improvement index of zero, there is another
optimal solution.
(e) none of the above

ANSWER: d {moderate, MORE THAN ONE OPTIMAL SOLUTION}

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?

(a) The supply must be less than the demand.
(b) The demand must be less than the supply.
(c) The number of occupied routes must always equal one less than the sum of the number of
rows plus the number of columns.
(d) The number of occupied routes must equal the number of columns plus the number of rows.
(e) none of the above

ANSWER: c {moderate, STEPPING-STONE METHOD: FINDING A LEAST-COST
SOLUTION}

10.76 Which method usually gives a very good initial solution and often results in the optimal solution to a
transportation problem?

(a) northwest corner rule
(b) Vogel's approximation method
(c) MODI method
(d) stepping-stone method
(e) none of the above

ANSWER: b {moderate, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND
AN INITIAL SOLUTION}

10.77 In applying Vogel's approximation method to a cost minimization problem, row and column penalties
are determined by

(a) finding the largest unit cost in each row or column.
(b) finding the smallest unit cost in each row or column.
(c) finding the sum of the unit costs in each row or column.
(d) finding the difference between the two lowest unit costs in each row and column.
(e) finding the difference between the two highest unit costs in each row and column.

ANSWER: d {moderate, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND
AN INITIAL SOLUTION}




Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

241

10.78 If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation
problem, we will use the

(a) stepping-stone method.
(b) northwest corner rule.
(c) Vogel's approximation method.
(d) MODI method.
(e) any of the above

ANSWER: b {moderate, DEVELOPING AN INITIAL SOLUTION: NORTHWEST CORNER
RULE}

10.79 Why does Vogels approximation method tend to find a good initial solution to the transportation
problem?

(a) It results from a linear program.
(b) It takes into account the costs associated with each route alternative.
(c) It results from the solution of a system of simultaneous equations.
(d) It is the mirror image of the northwest corner approach.
(e) Its implementation is very fast.

ANSWER: b {easy, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND AN
INITIAL SOLUTION}

10.80 When the solution of a transportation problem by Vogel's approximation method is done, we know that

(a) we have the optimal solution.
(b) we have the same initial solution as we would have obtained using the northwest corner rule.
(c) we have the same final solution as we would have obtained using the northwest corner rule.
(d) we must test the solution to see that it is optimal.
(e) none of the above

ANSWER: d {moderate, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND
AN INITIAL SOLUTION}

10.81 If the total supply from the sources does not equal the total demand from the destinations in the
transportation problem,

(a) if supply is greater than demand, add a dummy source or factory.
(b) the amount put in a dummy source or destination should make supply and demand equal.
(c) if demand is greater than supply, add a dummy destination or warehouse.
(d) all of the above
(e) none of the above

ANSWER: b {moderate, UNBALANCED TRANSPORTATION PROBLEMS}

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
242
10.82 In a transportation problem, degeneracy occurs when

(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

ANSWER: d {moderate, DEGENERACY IN TRANSPORTATION PROBLEMS}

10.83 To apply Vogels approximation method, first compute for each row and column the penalty faced if we
should ship over ________________________________________________.

(a) the second-best route instead of the least-cost route
(b) the highest-cost route instead of the least-cost route
(c) the highest-cost route instead of the second-highest-cost route
(d) the highest-cost route instead of the second-best route
(e) the route with the smallest demand or capacity, respectively

ANSWER: a {moderate, VOGELS APPROXIMATION METHOD: ANOTHER WAY TO FIND
AN INITIAL SOLUTION}

10.84 Practically speaking, multiple optimal solutions _____________________________________.

(a) are infeasible
(b) are unbounded
(c) are degenerate
(d) are unbalanced
(e) provide management with greater flexibility in selecting and using resources

ANSWER: e {easy, MORE THAN ONE OPTIMAL SOLUTION}

10.85 Which of the following is not a step in the Hungarian method of assignment?

(a) find the opportunity-cost table
(b) test for an optimal assignment
(c) enumerate all possible solutions
(d) revise the opportunity-cost table
(e) none of the above

ANSWER: c {moderate, ASSIGNMENT MODEL APPROACH}

10.86 Why dont we want to use the transportation algorithm to solve the assignment problem?

(a) It would likely lead to an unbounded solution.
(b) It would likely lead to a degenerate solution.
(c) It would likely lead to an infeasible solution.
(d) It would likely lead to multiple optima.
(e) It would likely lead to an unbalanced solution.

Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

243

ANSWER: b {moderate, ASSIGNMENT MODEL APPROACH}
10.87 In an assignment problem

(a) the number of rows and columns must be equal.
(b) the number of rows must exceed the number of columns.
(c) the number of rows must equal or exceed the number of columns.
(d) the number of columns must equal or exceed the number of rows.
(e) none of the above

ANSWER: a {moderate, ASSIGNMENT MODEL APPROACH}

10.88 In revising the opportunity cost table of the assignment problem, after drawing lines through all of the
zeros

(a) the smallest uncovered number is added to all zeros.
(b) the smallest uncovered number is added to all uncovered numbers.
(c) the largest uncovered number is added to all uncovered numbers.
(d) the smallest uncovered number is added to all numbers at the intersection of lines.
(e) the largest uncovered number is added to all numbers at the intersection of lines.

ANSWER: d {moderate, ASSIGNMENT MODEL APPROACH}

10.89 Which of the following methods is used only with the assignment problem?

(a) the Hungarian method
(b) stepping-stone method
(c) MODI method
(d) Vogels approximation method
(e) the simplex method

ANSWER: a {easy, ASSIGNMENT MODEL APPROACH}

10.90 Objectives of the assignment problem can include

(a) minimize total costs.
(b) minimize total time to perform the tasks at hand.
(c) minimize opportunity costs.
(d) maximize profit.
(e) all of the above

ANSWER: e {moderate, ASSIGNMENT MODEL APPROACH}









Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
244
10.91 In solving maximization assignment problems,

(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

ANSWER: b {moderate, MAXIMIZATION ASSIGNMENT PROBLEMS}
10.92 Find the solution to the transportation problem depicted below.

Table 10-34
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8


| 12


| 0




50

B
| 6


| 7


| 4


| 0



75

C
| 10


| 9


| 6


| 0




125

Demand

60

40

100

50


(a)
Table 10-34 a
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

40
| 12


| 0

10


50

B
| 6

60
| 7


| 4

15
| 0



75

C
| 10


| 9


| 6

85
| 0

40


125

Demand

60

40

100

50











Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

245

(b)
Table 10-34 b
To==> 1 2 3 Dummy Supply

From

A

| 10


| 8

20
| 12


| 0

30


50

B
| 6

60
| 7


| 4

15
| 0



75

C
| 10


| 9

20
| 6

85
| 0

20


125

Demand

60

40

100

50



(c)
Table 10-34 c
To==> 1 2 3 Dummy Supply

From

A

| 10

40
| 8


| 12


| 0

10


50

B
| 6


| 7

15
| 4

25
| 0

35


75

C
| 10

20
| 9


| 6

100
| 0

5


125

Demand

60

40

100

50


(d)
Table 10-34 d
To==> 1 2 3 Dummy Supply

From

A

| 10

50
| 8


| 12


| 0




50

B
| 6


| 7


| 4

75
| 0



75

C
| 10

10
| 9

40
| 6

25
| 0

50


125

Demand

60

40

100

50


(e) none of the above

ANSWER: a {hard, various, AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
246
10.93 Solve the following transportation table:

Table 10-35
To==> 1 2 3 Dummy Supply

From

A

| 5

50
| 8


| 8


| 0




40

B
| 6


| 9


| 4

75
| 0



85

C
| 6

10
| 9

40
| 6

25
| 0

50


110
Demand 50 60 85 40
(a)
Table 10-35a Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5

50
| 8


| 8


| 0




40

B
| 6


| 9


| 4

75
| 0



85

C
| 6

10
| 9

40
| 6

25
| 0

50


110
Demand 50 60 85 40
(b)
Table 10-35b Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5

50
| 8


| 8


| 0




40

B
| 6


| 9


| 4

75
| 0



85

C
| 6

10
| 9

40
| 6

25
| 0

50


110
Demand 50 60 85 40









Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

247

(c)
Table 10-35c Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5

40
| 8


| 8


| 0




40

B
| 6

10
| 9

60
| 4

15
| 0



85

C
| 6


| 9


| 6

70
| 0

40


110
Demand 50 60 85 40

(d)
Table 10-35d Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5


| 8


| 8


| 0

40


40

B
| 6


| 9


| 4

85
| 0



85

C
| 6

50
| 9

60
| 6


| 0




110
Demand 50 60 85 40

(e) none of the above

ANSWER: e {hard, various, AACSB: Analytic Skills}

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

From

A

| 5


| 7


| 8


| 0




20

B
| 3


| 9


| 9


| 0



65

C
5


| 9


| 6


| 0




90

Demand

30

40

85

20



Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
248
(a)
Table 10-36a Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5


| 7


| 8


| 0

20


20

B
| 3


| 9


| 9
65

| 0



65

C
| 5
30

| 9
40

| 6
20

| 0




90

Demand

30

40

85

20


(b)
Table 10-36b Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5


| 7
20

| 8


| 0




20

B
| 3
30

| 9


| 9
35

| 0



65

C
| 5


| 9
20

| 6
50

| 0
20



90

Demand

30

40

85

20





(c)
Table 10-36c Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5


| 7

20
| 8


| 0




20

B
| 3

30
| 9

15
| 9


| 0

20


65

C
5


| 9

5
| 6

85
| 0




90
Demand 30 40 85 20



Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

249

(d)
Table 10-36d Solution?
To==> 1 2 3 Dummy Supply

From

A

| 5

10
| 7


| 8


| 0

10


20

B
| 3


| 9

40
| 9


| 0

5


65

C
5


| 9


| 6

85
| 0

5


90
Demand 30 40 85 20

(e) none of the above
ANSWER: c {hard, various, AACSB: Analytic Skills}

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

From

A

| 4


| 7


| 10


| 12


2000

B
| 7


| 5


| 8


| 11




2500

C
9


| 8


| 6


10




2200

Demand

1000

2200

2300

1200


(a)
(a) Table 10-37a Solution?
To==> 1 2 3 4 Supply

From

A

| 4

1000
| 7


| 10

1000
| 12


2000

B
| 7


| 5

1000
| 8

300
| 11

1200


2500

C
9


| 8

1200
| 6

1000
| 10




2200

Demand

1000

2200

2300

1200


Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
250
(b)
Table 10-37b Solution?
To==> 1 2 3 4 Supply

From

A

| 4


| 7

200
| 10

800
| 12

1200


2000

B
| 7
1000

| 5


| 8

1500
| 11




2500

C
9


| 8

2000
| 6

200
| 10




2200

Demand

1000

2200

2300

1200



(c)
Table 10-37c Solution?
To==> 1 2 3 4 Supply

From

A

| 4


| 7

2000
| 10


| 12




2000

B
| 7

1000
| 5


| 8

300
| 11

1200


2500

C
9


| 8

200
| 6

1800
| 10




2200

Demand

1000

2200

2300

1200


(d)
Table 10-37d Solution?
To==> 1 2 3 4 Supply

From

A

| 4

1000
| 7


| 10


| 12

1000


2000

B
| 7


| 5

2200
| 8

100
| 11

200


2500

C
9


| 8


| 6

2200
| 10




2200

Demand

1000

2200

2300

1200


(e) none of the above

ANSWER: d {hard, various, AACSB: Analytic Skills}
Transportation and Assignment Models CHAPTER 10
Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.

251

PROBLEMS

10.96 Table 10-38 describes a transportation problem:

Table 10-38
To==> D E F Supply

From

A
| 2

| 5

| 2


40

B
| 1

| 4

| 2


30

C
| 4

| 3

| 2


30
Demand 20 30 50 100

(a) Use the northwest corner method to get an initial solution.
(b) What is the cost of the initial solution?
(c) Use the stepping-stone method to find the optimal solution.
(d) What is the cost of the optimal solution?
(e) Is there an alternate optimal solution?

ANSWER: (a)

To==> D E F Supply

From

A
| 2
20
| 5
20
| 2


40

B
| 1

| 4
10
| 2
20

30

C
| 4

| 3

| 2
30

30
Demand 20 30 50 100

(b) Cost = 280

(c) Optimal solution:

To==> D E F Supply

From

A
| 2

| 5

| 2
40

40

B
| 1
20
| 4

| 2
10

30

C
| 4

| 3
30
| 2


30
Demand 20 30 50 100

(d) Cost = 210

(e) no {hard, various, AACSB: Analytic Skills}

Transportation and Assignment Models CHAPTER 10

Copyright 2009 Pearson Education, Inc. Publishing as Prentice Hall.
252
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

ANSWER: MaryProject 2, ElizabethProject 4, StevenProject 1, JoshuaProject 3
{moderate, ASSIGNMENT MODEL APPROACH, AACSB: Analytic Skills}

SHORT ANSWER/ESSAY

10.98 Describe a general transportation problem.

ANSWER: a specific case of linear programming concerned with scheduling shipments from
sources to destinations while minimizing transportation costs {moderate, INTRODUCTION}

10.99 What is meant by a balanced transportation problem?

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?

ANSWER: It would result in a severe degeneracy problem. {moderate, ASSIGNMENT MODEL
APPROACH}

10.101 When is a dummy destination added to a transportation problem?

ANSWER: when total supply exceeds total demand {moderate, UNBALANCED
TRANSPORTATION PROBLEMS}

You might also like