Transportaion method

1. A feasible solution is said to be an ----- solution if it minimizes the total transportation

cost

• A. non degenerate basic feasible

• B. basic feasible

• C. feasible

• D. optimal

2. The another name of least cost method is ------

• Vam

• B. north west corner rule

• C. matrix minima method

• d. modi method

3. The number of non basic variables in the balanced transportation problem with 3 rows

and 5 columns is ------

• 15

• 7

• 8

• 9

4. An alternate optimal solution to a transportation problem is said to exist when one or

more of the unoccupied cells have zero value for the net cost change in the optimal

solution.

• true

• false

Row wise and column wise difference between two minimum costs is calculated

under ----

method.

• Vam

• least cost merhod

• modi method

A Transportation problem is a special case of linear programming problem

• True

• False

A transportation problem can always be represented by balanced model.

• True

• False

A basic feasible solution to a (m x n) transportation problem is said to be a ------ solution if

it contains exactly m + n - 1 non negative allocations in independent positions

• A. non degenerate basic feasible

• B. basic feasible

• C. feasible

• D. infeasible

An alternative optimal solution to a minimization problem exists whenever opportunity

cost corresponding to unused route of transportation is

• A. positive and greater than zero

• B. positive with at least one equal to zero

• C. negative with at least one equal to zero

To solve degeneracy, an unoccupied cell with ------------- cost is converted into occupied

cells by assigning an infinitely small amount to it.

• lowest

• highest

• normal