Transportation and Assignment Problems

In applying Vowgel's approximation method to a profit maximization problem, row and column penalties are determined by:

• finding the smallest unit cost in each row or column.

• finding the sum of the unit costs in each row or column.

• finding the difference between the two lowest unit costs in each row and column.

• finding the difference between the two highest unit costs in each row and column.

In a transportation problem, when the number of occupied cells is less than the number of rows plus the number of columns -1, we say that the solution is:

• Infeasible

• Non-Degenerate

• Optimal

• Degenerate

In a transportation problem, we must make the number of __________ and __________ equal.

• destinations; sources

• units supplied; units demanded

• columns; rows

• warehouses; suppliers

In case of an unbalanced problem, shipping cost coefficients of ____________ are assigned to each created dummy factory or warehouse.

• high positive costs

• high negative costs

• zero

• one

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 ___________.

• 1; 1

• $\infty$ ; $\infty$
  

• 0; 0

• -1; -1

In a transportation problem, a single source may supply the units to any number of destinations.

• True

• False

The cell evaluation d_ij = C_ij - (u_i + v_j) is used to calculate __________.

• Opportunity costs for using a particular route

• MODI cost values (u_i, v_j)

• Degeneracy index

• Optimality test

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

• True

• False

Always a transportation problem possess unique solution.

• True

• False

Which is true for assignment problem?

• The number of rows equals the number of columns

• One assignment for each row and each column

• All rim requirements are one

• All are true