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?
admin
10.1
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
10.2
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
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.3
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
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
}
10.4
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
10.5
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
10.6
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.7
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
10.8
Assuming that Table 10-11
represents the results of an iteration of a transportation model,
Table 10-11
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
The next tableau
will be:
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.9
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
10.10
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 10.1
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 10.2
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 Table 10-7Initial
tableno allocations yetTo==>123SupplyFromA| 4| 6| 4100B| 6| 5| 5200C| 5| 7| 6200Demand200200100Optimal
solution by the MODI methodTo==>123SupplyFromA| 4| 6| 4100100B| 6| 5200| 5200C| 5200| 7| 6200Demand20020010010.3
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 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 }10.4
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 10.5
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 10.6
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.7
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 10.8
Assuming that Table 10-11
represents the results of an iteration of a transportation model,Table 10-11To==>123SupplyFromA| 320| 620| 440B| 3| 430| 530C| 5| 720| 61030Demand207010The next tableau
will be:Table 10-12To=>123SupplyFromA| 3| 640| 440B| 3| 430| 530C| 520| 7| 61030Demand20701010.9
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 10.10
In Table 10-13, if cell A3 is
filled on the next iteration, what is the improvement in the objective
function?Table 10-13To==>123SupplyFromA| 320| 630| 350B| 4| 440| 340C| 5| 710| 61525Demand208015 (a) 60 (b) 30 (c) 530 (d) 590 (e) none
of the above
