Taylor Ims11 Tif Modb

Introduction to Management Science, 11e (Taylor)
Module B: Transportation and Assignment Solution Methods
1) In a transportation problem, items are allocated from sources to destinations at a minimum cost.
Answer: TRUE
Diff: 1
Section Heading: Solution of the Transportation Model
Keywords: transportation problem
2) The linear programming model for a transportation problem has constraints for supply at each source
and demand at each destination.
Answer: TRUE
Diff: 2
Keywords: transportation prob, linear prog model for a transportation prob
3) Transportation problems are solved manually within a tableau format.

Answer: TRUE
Diff: 2
4) In a balanced transportation model where supply equals demand, all constraints are equalities.
Answer: TRUE
Diff: 2
Keywords: transportation problem, balanced transportation model
5) In a balanced transportation model where supply equals demand, all constraints are inequalities.
Answer: FALSE
Diff: 2
Keywords: transportation prob, balanced transportation model, constraints
6) The supply and demand values along the outside rim of a tableau are called rim requirements.
Answer: TRUE
Diff: 3
Keywords: supply and demand values, rim requirements
7) Unacceptable (prohibited) routes in a transportation problem are assigned cost values of zero.
Answer: FALSE
Diff: 1
Keywords: prohibited routes
1
Copyright © 2013 Pearson Higher Education, Inc. Publishing as Prentice Hall
8) An assignment problem is a special form of transportation problem where all supply and demand
values equal 1.
Answer: TRUE
Diff: 2
Section Heading: Solution of the Assignment Model
Keywords: assignment problem
values equal 0.
Answer: FALSE
Diff: 2
10) An opportunity cost table is developed by first subtracting the minimum value in each row from all
other row values and then repeating this process for each column.
Answer: TRUE
Diff: 3
Keywords: opportunity cost table
11) An opportunity cost table is developed by first subtracting the minimum value in each row from all
other row values and then repeating this process for each row.
Answer: FALSE
Diff: 3
12) Assignments are made to locations with 0 in the opportunity cost table.
Answer: TRUE
Diff: 2
13) Assignments are made to locations with 1 in the opportunity cost table.
Answer: FALSE
Diff: 2
14) An optimal solution occurs when the number of independent unique assignments equals the number
of rows or columns.
Answer: TRUE
Diff: 1
Keywords: assignment problem, unique assignments
2
15) If the number of unique assignments is less than the number of rows or columns, a line test must be
used.
Answer: TRUE
Diff: 1
Keywords: assignment problem, unique assignments
16) An assignment problem that involves 6 machines to be assigned to 4 workers cannot be solved using
the assignment problem solution procedure described.
Answer: FALSE
Diff: 2
17) The transportation model is a special type of linear regression model.

Answer: FALSE
Diff: 1
Keywords: transportation model
18) The transportation model assumes that shipping costs are the same, regardless of the number of units
shipped.
Answer: TRUE
Diff: 1
19) It is not possible to solve a transportation problem that has ≤ instead of = signs for the supply
constraints.
Answer: FALSE
Diff: 1
20) Transportation problems can be solved by the simplex method.

Answer: TRUE
Diff: 1
21) When the number of people and the number of tasks are not equal in an assignment problem then the
problem cannot be solved.
Answer: FALSE
Diff: 1
Keywords: assignment method
3
22) In the ________ method, the largest possible allocation is made to the cell in the upper-left-hand
corner of the tableau, followed by allocations to adjacent feasible cells.
Answer: northwest corner
Diff: 2
Keywords: northwest corner method
23) In using the minimum cell cost method, as much as possible is allocated to the cell with the
________ cost.
Answer: minimum
Diff: 1
Keywords: minimum cell cost method
24) ________ model is a method for determining an initial solution for a transportation problem based
on the concept of penalty cost or regret.
Answer: Vogel's approximation
Diff: 2
Keywords: Vogel's approximation method
25) In using the Vogel's Approximation model, a ________ is the difference between the largest and
next largest cell cost in a row.
Answer: penalty cost
Diff: 2
Keywords: Vogel's Approximation model, penalty cost
26) Vogel's approximation method allocates to the minimum cost cell in the row or column with the
________ penalty cost.
Answer: largest
Diff: 2
Keywords: Vogel's Approximation model, penalty cost
27) A multiple optimal solution occurs when an empty cell has a cost change of ________ and all other
empty cells are positive.
Answer: zero
Diff: 2
Keywords: stepping stone method, MODI
28) When demand exceeds supply, a dummy ________ is added to the solution tableau.
Answer: row or supply
Diff: 1
Section Heading: The Unbalanced Transportation Problem
Keywords: unbalanced transportation problem
29) When supply exceeds demand, a dummy ________ is added to the solution tableau.
Answer: column or destination
Diff: 1
Keywords: unbalanced transportation problem
4
30) In a transportation tableau with m rows and n columns, if there are fewer than n+m-1 allocations, the
tableau is said to be ________.
Answer: degenerate
Diff: 2
Keywords: transportation tableau, degenerate solution
31) In a transportation tableau to rectify a degenerate tableau, an empty cell must artificially be treated
as an ________ cell.
Answer: occupied or full
Diff: 3
Keywords: degenerate solution, transportation tableau
32) A(n) ________ problem is a special form of transportation problem where all supply and demand
values equal 1.
Answer: assignment
Diff: 2
33) A(n) ________ table is developed by first subtracting the minimum value in each row from all other
row values and then repeating the process for each column.
Answer: opportunity cost
Diff: 2
34) A(n) ________ solution occurs when the number of independent unique assignments equals the
number of rows or columns.
Answer: optimal
Diff: 2
Keywords: optimal solution of the assignment problem, optimal assignments
35) The two solution methods for transportation problems that do not require the use of a computer are
________ and ________.
Answer: stepping stone, MODI
Diff: 1
Keywords: transportation problem solution methods
36) Generally, ________ problems match people to an equal number of tasks at a minimum cost.
Answer: assignment
Diff: 2
Keywords: assignment
5
37) If the number of unique assignments is less than the number of rows, then a ________ test must be
used.
Answer: line
Diff: 2
38) The three methods for identifying initial feasible solutions to transportation problems are ________,
________, and ________.
Answer: northwest corner method, minimum cell cost method, Vogel's approximation method
Diff: 1
Keywords: initial feasible solutions
Given the following transportation tableauwhere the numbers in each cell represent transportation
costs from the specific source to the specific destinationwith supply figures corresponding to each
source and demand figures corresponding to each destination:
39) According to the Northwest Corner method, the initial solution would give to cell B2 a loading of
________.
Answer: 150 units
Diff: 2
40) According to the Northwest Corner method, the initial solution would have a total transportation
cost of ________.
Answer: $2600
Diff: 2
Keywords: northwest corner method, total cost calculations
41) According to the Vogel's Approximation Method, the initial solution would give to cell B2 a loading
of ________.
Answer: 100 units
Diff: 2
Keywords: Vogel's Approximation Method
6
42) According to the Vogel's Approximation Method, the initial solution would have a total
transportation cost of ________.
Answer: $2455
Diff: 2
43) According to the minimum cell cost method, the initial solution would give to cell C1 a loading of
________.
Answer: 350 units
Diff: 2
44) According to the minimum cell cost method, the initial solution would have a total transportation
cost of ________.
Answer: $2455
Diff: 2
Canning Transport wants to move goods from three (3) factories to three (3) distribution centers.
Information about the move is given below:
Shipping costs are (in $):
45) According to the Northwest Corner method, the initial solution would give to cell CIII a loading of
________.
Answer: 125 units
Diff: 2
46) According to the Northwest Corner method, the initial solution would have a total transportation
cost of ________.
Answer: $1800
Diff: 2
7
47) According to the Vogel's Approximation Method, the initial solution would give to cell CII a
loading of ________.
Answer: 0 or 25 units
Diff: 2
48) According to the Vogel's Approximation Method, the initial solution would have a total
transportation cost of ________.
Answer: $1700
Diff: 2
49) According to the minimum cell cost method, the initial solution would give to cell BI a loading of
________.
Answer: 25 units
Diff: 2
50) According to the minimum cell cost method, the initial solution would have a total transportation
cost of ________.
Answer: $1700
Diff: 2
51) SS 1 2
1 100 5 6
2 200 4 2
3 150 3 6
4 50 9 7
DD 250 250
What is the objective function?

Answer: Min 5x11 + 6x12 + 4x21 + 2x22 + 3x31 + 6x32 + 9x41 + 7x42
Diff: 2
Keywords: transportation problem formulation, objective function
8
52) SS 1 2
1 100 5 6
2 200 4 2
3 150 3 6
4 50 9 7
DD 250 250
What are the supply-side constraints?

Answer:
x11 +x12 ≤ 100
x21 + x22 ≤ 200
x31 + x32 ≤ 150
x41 + x42 ≤ 50
Diff: 2
Keywords: transportation problem formulation, supply-side constraints
53) SS 1 2
1 100 5 6
2 200 4 2
3 150 3 6
4 50 9 7
DD 250 250
What are the demand-side constraints?

Answer:
x11 + x21 + x31 + x41 = 250
x12 + x22 + x32 + x42 = 250
Diff: 2
Keywords: transportation problem formulation, demand-side constraints
9
54) Consider the following transportation tableau with the initial solution provided. Use the stepping
stone method to identify a better allocation.
Answer:
Diff: 2
Keywords: transportation, stepping stone
55) An independent operator is planning shipments of gasoline from two sources to three destinations.
Per ton transportation costs are given in the following table.
There are 1000 tons available at A and 1300 tons available at B. Since the destinations want as much as
possible, the owner has decided to ship out all available quantities. Solve using either stepping stone or
MODI.
Answer: 1300 tons will be sent to D and 1000 will be sent to C. None will be sent to E, since minimum
demand requirements are not specified for each destination.
Diff: 2
10
56) A large book publisher has five manuscripts that must be edited as soon as possible. Five editors are
available for doing the work; however, their working times on the various manuscripts will differ based
on their backgrounds and interests. The publisher wants to use an assignment method to determine who
does which manuscript. Estimates of editing times (in hours) for each manuscript by each editor are:
How many variables are involved in this assignment method?

Answer: 25
Diff: 3
Keywords: assignment model formulation
57) A large book publisher has five manuscripts that must be edited as soon as possible. Five editors are
available for doing the work; however, their working times on the various manuscripts will differ based
on their backgrounds and interests. The publisher wants to use an assignment method to determine who
does which manuscript. Estimates of editing times (in hours) for each manuscript by each editor are:
How many constraints are needed?

Answer: 10
Diff: 3
Keywords: assignment model formulation, constraints
11
58) The student internship director needs as much coverage as possible in the office next week. The
more hours that can be put in each day, the better. She has asked the students to provide a list of how
many hours they are available each day of the week. Each student can be there on only one day and
there must be a student in the office each day of the week. Use the table below and the tables provided to
determine the schedule that gives the most coverage. Note that the objective of this problem is to
maximize the hours worked, not minimize.
Student Mon Tue Wed Thurs Fri

A 2 4 8 4 6
B 3 2 7 3 2
C 6 8 6 5 4
D 7 4 3 6 8
E 4 5 3 1 4
Answer: 1. Convert to a minimization problem by subtracting each value from 8:

A 6 4 0 4 2
B 5 6 1 5 6
C 2 0 2 3 4
D 1 4 5 2 0
E 4 3 5 7 4
2. Subtract the minimum value in each row from all other row values:
A 6 4 0 4 2
B 4 5 0 4 5
C 2 0 2 3 4
D 1 4 5 2 0
E 1 0 2 4 1
3. Subtract the minimum column value in each column from all other column values:
A 5 4 0 2 2
B 3 5 0 2 5
C 1 0 2 1 4
D 0 4 5 0 0
E 0 0 2 2 1
4. Conduct the line test:
12
5. Subtract the minimum value from all uncovered numbers and add it to the intersection:
A 3 2 0 0 0
B 1 3 0 0 3
C 1 0 4 1 4
D 0 4 6 0 0
E 0 0 4 2 1
6. There are multiple optimal solutions:

Hours
Solution Mon Tue Wed Thurs Fri
Covered
1 E C A B D 31
2 E C B A D 31
3 E C B D A 31
Diff: 2
59) There are 4 jobs in a 4 person office that must be done as quickly as possible. The supervisor has
used the assignment method to assign people to jobs, and has completed the first step. She had to rush
off to a meeting and has asked to assign the jobs to the people before she returns. The original matrix
which shows the expected completion time for each person for each job, and the one she just completed
are both shown below.
Job Ruth Steve Valerie Wayne

A 8 26 17 11
B 13 28 4 26
C 38 19 18 15
D 19 26 24 10

A 0 18 9 3
B 9 24 0 22
C 23 4 3 0
D 9 16 14 0
Which person should be assigned to which job? How long will the jobs take?
Answer:
A 0 14 9 3
B 9 20 0 22
C 23 0 3 0
D 9 12 14 0
Ruth does job A. Valerie does job B. Steve does job C. Wayne does job D. Total time is 41 minutes.
Diff: 2
13
60) In a transportation problem, items are allocated from sources to destinations at a
A) maximum cost.
B) minimum cost.
C) minimum profit.
D) minimum revenue.
Answer: B
Diff: 1
Section Heading: The Transportation Model
Keywords: transportation problem, objective function, cost minimization
61) The transportation method assumes that

A) the number of rows is equal to the number of columns.
B) there must be at least 2 rows and at least 2 columns.
C) both A and B
D) the product of rows minus 1 and columns minus 1 should not be less than the number of completed
cells.
Answer: B
Diff: 2
62) The transportation method is a linear programming technique where linearity can be found in which
of the following ways?
A) The cost of goods shipped from any source to any destination is a linear function of quantity shipped.
B) The total cost associated with a given plan is a linear function of shipping costs.
C) Cell evaluations assume linear movements through the matrix.
D) The cost of goods shipped from any source to any destination is a linear function of the cost per unit.
Answer: A
Diff: 3
Keywords: transportation method, transportation model
63) Which of the following assumptions is not an assumption of the transportation model?
A) Shipping costs per unit are constant.
B) There is one transportation route between each source and destination.
C) There is one transportation mode between each source and destination.
D) Actual total supply and actual total demand must be equal.
Answer: D
Diff: 2
Keywords: transportation method, transportation model assumptions
14
64) The problem that deals with the distribution of goods from several sources to several destinations is
the
A) network problem.
B) assignment problem.
C) transportation problem.
D) transshipment problem.
Answer: C
Diff: 1
65) In the linear programming formulation of a transportation network,

A) there is one variable for each arc.
B) there is one constraint for each node.
C) the sum of variables corresponding to arcs out of an origin node is constrained by the supply at that
node.
D) all of the above
Answer: D
Diff: 2
Keywords: linear programming formulation of a transportation problem
66) Which of the following assumptions is not an assumption of the transportation model?
A) Shipping costs are constant.
B) There is only one transportation route between source and destination.
C) There is only one transportation mode between source and destination.
D) Actual supply and actual demand must be equal.
Answer: D
Diff: 2
Keywords: transportation method, transportation model assumptions
67) The ________ problem deals with the distribution of goods from several sources to several
destinations.
A) network
B) assignment
C) transportation
D) transshipment
Answer: C
Diff: 1
15
68) In a transportation problem, items are allocated from sources to destinations at a ________ cost.
A) maximum
B) minimum
C) high
D) low
Answer: B
Diff: 1
69) The linear programming model for a transportation problem has constraints for
A) supply at each source.
B) supply at each source and demand at each destination.
C) demand at each destination.
D) a feasible solution.
Answer: B
Diff: 2
Keywords: linear programming formulation of a transportation problem
70) In a balanced transportation model where supply equals demand, all constraints are
A) inequalities.
B) equalities.
C) A and B
D) none of the above
Answer: B
Diff: 2
Keywords: balanced transportation model, transportation model formulation
71) The supply and demand values along the outside rim of a tableau are called
A) rim requirements.
B) rim columns.
C) rim rows.
D) all of the above
Answer: A
Diff: 3
Keywords: rim requirements
72) Which of the following are assumptions or requirements of the transportation problem?
A) Minimum quantities must be shipped.
B) Shipping costs per unit do not vary with the quantity shipped.
C) There can only be one source.
D) all of the above
Answer: B
Diff: 3
Keywords: assumptions of the transportation problem
16
Use the following table and the information to answer the questions below.
In the following transportation matrix, all cells except 2C have been evaluated and show no
improvement. Evaluate that cell.
73) What is the reduced cost if we decide to allocate to cell 2C?

A) -2
B) -1
C) 0
D) +1
E) +2
Answer: A
Diff: 2
Keywords: stepping stone method, reduced cost
74) How many units would be allocated to cell 2C?

A) 10
B) 14
C) 6
D) 0
E) 20
Answer: B
Diff: 3
75) Make the necessary allocation to cell 2C and determine the total transportation cost.
A) 936
B) 928
C) 908
D) 852
E) 878
Answer: C
Diff: 3
Keywords: stepping stone method
17
76) Which of the following are assumptions or requirements of transportation problems?
I. Goods are the same from each source.
II. There must be a single source.
III. Minimum quantities must be shipped.
IV. Shipping costs per unit do not vary with the quantity shipped.
A) I and III
B) I, II, and IV
C) I and IV
D) II and III
Answer: D
Diff: 2
Keywords: transportation problem, assumptions
77) Consider the following transportation tableau which shows the initial solution. Evaluate the cost of
allocating units to cell DR.
A) -5
B) -2
C) 0
D) 3
E) 5
Answer: E
Diff: 2
18
78) Consider the following transportation tableau which shows the initial solution. Evaluate the cost of
allocating units to cell CR.
A) -12
B) -9
C) -6
D) -2
E) +3
Answer: B
Diff: 2
values equal:
A) -1 or 1
B) -1
C) 0
D) 1
Answer: D
Diff: 2
Section Heading: Solution of the Assignment Problem
80) Assignments are made to locations with ________ in the opportunity cost table.
A) -1 or 1
B) -1
C) 1
D) 0
Answer: D
Diff: 2
Keywords: assignment problem, assignment problem solution procedure
19
81) If the number of unique assignments is ________ the number of rows or columns, a line test must be
used.
A) more than
B) less than
C) higher than
D) equal to
Answer: B
Diff: 1
Keywords: assignment problem, assignment problem solution procedure
82) A transportation table that has a cell evaluation of 0 means that

A) the table is optimal.
B) an equivalent alternative solution exists.
C) supply and demand are equal.
D) the solution is not optimal.
Answer: B
Diff: 2
Keywords: transportation table, transportation model solution procedure
83) A transportation table contains an optimal solution when all the empty cell evaluations are
A) positive or 0.
B) negative or 0.
C) positive.
D) negative.
Answer: A
Diff: 2
Keywords: transportation table, transportation model solution procedure
84) In an assignment problem,

A) one agent can do parts of several tasks.
B) one task can be done by only one agent.
C) each agent is assigned to its own best task.
D) all of the above
Answer: B
Diff: 2
85) The difference between the assignment and the transportation problem is that
A) each supply and demand value is 1 in the assignment problem.
B) total supply must equal total demand in the transportation problem.
C) the number of origins must equal the number of destinations in the transportation problem.
D) all of the above
Answer: A
Diff: 2
Keywords: assignment and the transportation problems
20
86) A company that repairs and maintains HVAC systems for businesses wants to assign three service
teams to three geographical zones, one team to each zone. Because of the familiarity with each team to
the companies located in a zone, there are differences in the efficiencies of each team, reflected in the
service costs. The matrix below shows the service costs (in thousands of dollars) for each team in each
zone. Assign each team to a zone that minimizes cost.
A) Assign T1 to zone A, T2 to zone B, and T3 to zone C.

B) Assign T1 to zone A, T2 to zone C, and T3 to zone B.
C) Assign T1 to zone B, T2 to zone A, and T3 to zone C.
D) Assign T1 to zone B, T2 to zone C, and T3 to zone A.
E) Assign T1 to zone C, T2 to zone A, and T3 to zone B.
Answer: C
Diff: 3
21

Taylor Ims11 Tif Modb

Uploaded by

Copyright:

Available Formats

Taylor Ims11 Tif Modb

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Taylor Ims11 Tif Modb

Uploaded by

Copyright:

Available Formats

Introduction to Management Science, 11e (Taylor)

Module B: Transportation and Assignment Solution Methods

3) Transportation problems are solved manually within a tableau format.

17) The transportation model is a special type of linear regression model.

20) Transportation problems can be solved by the simplex method.

Shipping costs are (in $):

What is the objective function?

What are the supply-side constraints?

What are the demand-side constraints?

How many variables are involved in this assignment method?

How many constraints are needed?

Student Mon Tue Wed Thurs Fri

Answer: 1. Convert to a minimization problem by subtracting each value from 8:

4. Conduct the line test:

6. There are multiple optimal solutions:

Job Ruth Steve Valerie Wayne

Job Ruth Steve Valerie Wayne

61) The transportation method assumes that

65) In the linear programming formulation of a transportation network,

73) What is the reduced cost if we decide to allocate to cell 2C?

74) How many units would be allocated to cell 2C?

82) A transportation table that has a cell evaluation of 0 means that

84) In an assignment problem,

A) Assign T1 to zone A, T2 to zone B, and T3 to zone C.

You might also like