Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
1.
|
A solution to a transportation problem that has less than m + n - 1 cells with positive allocations in the transportation tableau is
a. | an optimal solution. | b. | an initial feasible
solution. | c. | a minimum-cost solution. | d. | a degenerate
solution. |
|
|
|
2.
|
The optimal solution is found in an assignment matrix when the minimum number of
straight lines needed to cover all the zeros equals
a. | (the number of agents) - 1. | b. | (the number of
agents). | c. | (the number of agents) + 1. | d. | (the number of agents) + (the number of
tasks). |
|
|
|
3.
|
The stepping-stone method requires that one or more artificially occupied cells
with a flow of zero be created in the transportation tableau when the number of occupied cells is
fewer than
a. | m + n - 2 | b. | m + n -
1 | c. | m + n | d. | m + n + 1 |
|
|
|
4.
|
The per-unit change in the objective function associated with assigning flow to
an unused arc in the transportation simplex method is called the
a. | net evaluation index. | b. | degenerate value. | c. | opportunity
loss. | d. | simplex multiplier. |
|
|
|
5.
|
The difference between the transportation and assignment problems is that
a. | total supply must equal total demand in the transportation
problem | b. | the number of origins must equal the number of destinations in the transportation
problem | c. | each supply and demand value is 1 in the assignment problem | d. | there are many
differences between the transportation and assignment problems |
|
|
|
6.
|
An example of a heuristic is the
a. | minimum-cost method. | b. | stepping-stone method. | c. | Hungarian
method. | d. | MODI method. |
|
|
|
7.
|
Identifying the outgoing arc in Phase II of the transportation simplex method is
performed using the
a. | minimum cost method. | b. | MODI method. | c. | stepping-stone
method. | d. | matrix reduction method. |
|
|
|
8.
|
The MODI method is used to
a. | identify an outgoing arc. | b. | identify an incoming arc. | c. | identify unoccupied
cells. | d. | identify an initial feasible solution. |
|
|
|
9.
|
To use the transportation simplex method, a transportation problem that is
unbalanced requires the use of
a. | artificial variables. | b. | one or more transshipment
nodes. | c. | a dummy origin or destination. | d. | matrix
reduction. |
|
|
|
10.
|
To use the Hungarian method, a profit-maximization assignment problem
requires
a. | converting all profits to opportunity losses. | b. | a dummy agent or
task. | c. | matrix expansion. | d. | finding the maximum number of lines to cover
all the zeros in the reduced matrix. |
|