Operation Research (3151910) MCQs

MCQs of Transportation and Assignment

Showing 21 to 30 out of 38 Questions
21.

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

(a)

destinations; sources

(b)

units supplied; units demanded

(c)

columns; rows

(d)

positive cost coefficients; negative cost coefficients

Answer:

Option (b)

22.

The assignment problem will have alternate solutions

(a)

when total opportunity cost matrix has at least one zero in each row and column

(b)

when total opportunity cost matrix has at least two zero in each row and column

(c)

when there is a tie between zero opportunity cost cells

(d)

if two diagonal elements are zeros

Answer:

Option (c)

23.

The initial solution to a transportation problem can be obtained by applying any known method. However, the only condition is that

(a)

the solution be optimal

(b)

the rim conditions are satisfied

(c)

the solution is not degenerate

(d)

all of the above

Answer:

Option (b)

24.

The dummy source or destination in a transportation problem u added to

(a)

satisfy rim conditions

(b)

prevent solution from becoming degenerate

(c)

ensure that total cost does not exceed a limit

(d)

none of the above

Answer:

Option (a)

25.

The occurrence of degeneracy while solving a transportation- problem means that

(a)

 total supply equals total demand

(b)

 the solution so obtained is not feasible

(c)

the few allocations become negative

(d)

None of the above

Answer:

Option (b)

26.

An alternative optimal solution to a minimization transportation 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

(d)

none of the above

Answer:

Option (b)

27.

One disadvantage of using the North-West Corner Rule to find initial the solution to the transportation problem is that

(a)

it is complicated to use

(b)

 it does not take into account the cost of trans-portation

(c)

it leads to a degenerate initial solution

(d)

 all of the above

Answer:

Option (b)

28.

The solution to a transportation problem with m-rows (supplies) and n-columns (destination) is feasible if the number of positive allocations are

(a)

m+n

(b)

m×n

(c)

m+n-1

(d)

m+n+1

Answer:

Option (c)

29.

The calculation of opportunity cost in the MODI method is analogous to a

(a)

Cj - Zj value for non-basic variable columns in the simplex method

(b)

value of a variable in XB column of the simplex method

(c)

 variable in the B-column in the simplex method

(d)

none of the above

Answer:

Option (a)

30.

An unoccupied cell in the transportation method is analogous to a

(a)

Cj -Zj value in the simplex table

(b)

variable in the B-column in the simplex table

(c)

variable not in the B-column in the simplex table

(d)

value in the X_B column in the simplex table

Answer:

Option (c)

Showing 21 to 30 out of 38 Questions