Your Results for: "Multiple Choice" Print this page
Site Title: Quantitative Analysis for Summary of Results
Management, 11/e Global
Edition 10% Correct of 10 Scored items:
1 Correct: 10%
Book Title: Quantitative Analysis for
Management, 11/e Global 9 Incorrect: 90%
Edition
More information about scoring
Book Render
Author:
Location on Chapter 9: Transportation and
Site: Assignment Models > Self-Study
Quizzes > Multiple Choice
Date/Time July 3, 2020 at 1:24 PM
Submitted: (UTC/GMT)
1. Which method usually gives a very good solution to the assignment
problem?
Vogel's approximation method
Your Answer:
CORRECT.
2. In applying Vogel's approximation method to a profit maximization
problem, row and column penalties are determined by:
finding the largest unit cost in each row or column.
Your Answer:
Correct Answer: finding the difference between the two highest unit
costs in each row and column.
Incorrect. See section 10.6.
3. The northwest corner rule requires that we start allocating units to
shipping routes in the:
middle cell.
Your Answer:
Correct Answer: Upper left-hand corner of the table.
Incorrect.
4. In a transportation problem, when the number of occupied routes is less
than the number of rows plus the number of columns -1, we say that the
solution is:
Unbalanced.
Your Answer:
Correct Answer: Degenerate.
Incorrect. See section 10.8
5. The only restriction we place on the initial solution of a transportation
problem is that:
(blank)
Your Answer:
6. The table
represents a solution that is:
an initial solution.
Your Answer:
Correct Answer: degenerate.
Incorrect. See section 10.8.
7. Which of the following is used to come up with a solution to the
assignment problem?
MODI method
Your Answer:
Correct Answer: Hungarian method
Incorrect
8. What is wrong with the following table?
Nothing is wrong.
Your Answer:
Correct Answer: The solution is infeasible.
Incorrect. See section 10.2.
9. The solution presented in the following table is
infeasible.
Your Answer:
Correct Answer: Optimal.
Incorrect. See section 10.4.
10 The solution shown
.
was obtained by Vogel's approximation. The difference between the
objective function for this solution and that for the optimal is
40
Your Answer:
Correct Answer: 80
Incorrect. See sections 10.4 and 10.6.
The form below can be used to email these results to up to four different email addresses.
E-mail Your Results
My name is (first last):
E-mail my results to:
E-mail address: Send as:
Text
E-mail my results toMe
Text
E-mail my results toInstructor
Text
E-mail my results toTA
Text
E-mail my results toOther
Help
Your Results for: "True or False" Print this page
Site Title: Quantitative Analysis for Summary of Results
Management, 11/e Global 55% Correct of 11 Scored items:
Edition 6 Correct: 55%
Book Title: Quantitative Analysis for 5 Incorrect: 45%
Management, 11/e Global
Edition More information about scoring
Book Render
Author:
Location on Chapter 9: Transportation and
Site: Assignment Models > Self-Study
Quizzes > True or False
Date/Time July 3, 2020 at 1:25 PM
Submitted: (UTC/GMT)
1. The objective of a transportation problem is to schedule shipments from
sources to destinations so that the total transportation and production
costs are minimized.
True
Your Answer:
CORRECT.
2. In a transportation problem, a single source may supply something to all
destinations.
True
Your Answer:
CORRECT.
3. A transportation model must have the same number of rows as columns.
True
Your Answer:
Correct Answer: False
Incorrect. See section 10.2.
4. In the transportation model, we must always make the total supply equal
to the total demand.
True
Your Answer:
CORRECT.
5. The second step in the MODI method is to solve the system of equations
for all R and K values.
True
Your Answer:
Correct Answer: False
Incorrect. That will be the third step.
6. 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 that we will have to perform additional iterations.
True
Your Answer:
CORRECT.
7. It is usually possible to find an optimal solution to a transportation
problem that is degenerate.
False
Your Answer:
Correct Answer: True
Incorrect. See section 10.8.
8. Multiple solutions are possible for a transportation problem if only one
improvement index that we calculated for the unused squares is zero.
True
Your Answer:
Correct Answer: False
Incorrect. It is when one or more are zero.
9. 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.
False
Your Answer:
CORRECT.
10 The solution found by the stepping-stone or MODI methods is always to
be preferred over that found by Vogel's approximation.
.
True
Your Answer:
Correct Answer: False
Incorrect. See sections 10.4, 10.5, and 10.6.
11 The Hungarian method operates on the principle of matrix reduction,
whereby the cost table is reduced to a set of opportunity costs.
.
True
Your Answer:
CORRECT.
The form below can be used to email these results to up to four different email addresses.
E-mail Your Results
My name is (first last):
E-mail my results to:
E-mail address: Send as:
Text
E-mail my results toMe
Text
E-mail my results toInstructor
Text
E-mail my results toTA
Text
E-mail my results toOther
Help
Your Results for: "Fill In The Blanks" Print this page
Site Title: Quantitative Analysis for Summary of Results
Management, 11/e Global
Edition 30% Correct of 10 Scored items:
3 Correct: 30%
Book Title: Quantitative Analysis for
Management, 11/e Global 7 Incorrect: 70%
Edition
More information about scoring
Book Render
Author:
Location on Chapter 9: Transportation and
Site: Assignment Models > Self-Study
Quizzes > Fill In The Blanks
Date/Time July 3, 2020 at 1:26 PM
Submitted: (UTC/GMT)
1. In a transportation problem, we must make the number of __________
and __________ equal.
destinations; sources
Your Answer:
Correct Answer: units supplied; units demanded
Incorrect. See section 10.7.
2. __________ or __________ are used to "balance" an assignment or
transportation problem.
Large cost coefficients; small cost coefficients
Your Answer:
Correct Answer: Dummy rows; dummy columns
Incorrect. See Section 10.7.
3. The net cost of shipping one unit on a route not used in the current
transportation problem solution is called the __________.
MODI index
Your Answer:
Correct Answer: Improvement index
Incorrect. See section 10.4.
4. The procedure used to solve assignment problems wherein one reduces
the original assignment costs to a table of opportunity costs is called
__________.
MODI method
Your Answer:
Correct Answer: matrix reduction
Incorrect. See section 10.13.
5. The method of finding an initial solution based upon opportunity costs is
called __________.
Vogel's approximation
Your Answer:
CORRECT.
6. An assignment problem can be viewed as a special case of transportation
problem in which the capacity from each source is _______ and the
demand at each destination is ________.
0; 0
Your Answer:
Correct Answer: 1; 1
Incorrect. See section 10.13.
7. __________ occurs when the number of occupied squares is less than the
number of rows plus the number of columns minus one.
Unboundedness
Your Answer:
Correct Answer: Degeneracy
Incorrect. See section 10.8.
8. Both transportation and assignment problems are members of a category
of LP problems called ______.
network flow problems
Your Answer:
CORRECT.
9. The equation Ri + Kj = Cij is used to calculate __________.
an improvement index for the stepping-stone method
Your Answer:
Correct Answer: the MODI cost values (Ri, Kj)
Incorrect. See section 10.5.
10 In case of an unbalanced problem, shipping cost coefficients of ______
are assigned to each created dummy factory or warehouse.
.
zero
Your Answer:
CORRECT.
The form below can be used to email these results to up to four different email addresses.
E-mail Your Results
My name is (first last):
E-mail my results to:
E-mail address: Send as:
Text
E-mail my results toMe
Text
E-mail my results toInstructor
Text
E-mail my results toTA
Text
E-mail my results toOther
Help
50% (6 out of 12 correct)
1. Transportation and assignment problems can be solved by simplex method though
special purpose algorithms offer an easier solution procedure.
A. True
B. False
2. The total supply must equal total demand in a transportation problem in order to
solve it by the transportation algorithm.
A. True
B. False
3. XYZ Inc. manufactures desks and chairs in all its four furniture manufacturing
plants. It has 5 warehouses across the country. One transportation problem can be
used to determine how to ship desks and chairs.
A. True
B. False
4. Transshipment problem can be solved using the transportation formulation, as long
as we are assured that no material stays in the intermediate points permanently.
A. True
B. False
5. Transshipment problem formulation may be used in place of transportation
formulation when there are two products that are being shipped, each having its
own per unit cost of shipping.
A. True
B. False
6. In a linear programming formulation of the assignment problem, the RHS of all
constraints is greater than 1.
A. True
B. False
7. In the transportation problem model for production planning discussed in your
text, if there are 3 periods and 4 methods of manufacture in each period, how many
rows will be needed?
A. 12.
B. 7.
C. 13.
D. 8.
8. In the linear programming formulation of the transportation problem, cost of
transporting one unit of the material from a supply point to a demand point appears
in
A. the objective function only.
B. the constraints only.
C. both objective function and constraints.
D. neither objective function nor constraints.
9. Data on cost, demand and supply for a balanced (total supply equals total demand)
transportation problem is given in the table below. In the linear programming
formulation of this transportation problem, with Xij denoting the amount shipped
from supply point i (1 or 2) to demand point j (1,2 or 3) the correct constraint to
make sure that supply available in supply point # 2 will be fully used is:
A.
B.
C.
D.
10. In a transportation problem with total demand equal to 1200 and total supply
equal to 900, we should add a _______________ _____________ with a quantity
equal to ___________ to convert it to a balanced problem.
A. Dummy supply 300.
B. Dummy supply 2100.
C. Dummy demand 300.
D. Dummy demand 2100.
11. In the linear programming formulation of the transshipment problem, demand at
the destination points are required to be satisfied from shipment from
A. origins.
B. intermediate points.
C. either origins or intermediated points.
D. origins or external sources.
12. A transshipment problem has 3 origins, 2 intermediate points and 4 destinations.
The number of decision variables in the linear programming formulation of this
problem will be
A. 24.
B. 9.
C. 48.
D. 14.
