Operation Research (3151910) MCQs

MCQs of Transportation and Assignment

Showing 1 to 10 out of 38 Questions
1 2 3 4
1.

The transportation problem is basically a

(a)

Maximization model
(b)

Minimization model
(c)

Transshipment problem
(d)

Iconic model
Answer:

Option (b)

2.

To convert the transportation problem into a maximisation model we have to

(a)

Write the inverse of the matrix
(b)

Multiply the rim requirements by –1
(c)

Subtract all the values from the maximum value of the matrix
(d)

We cannot convert the transportation problem into a maximization problem, as it is basically, a minimization problem
Answer:

Option (c)

3.

The column, which is introduced in the matrix to balance the rim requirements, is known as

(a)

Key column
(b)

Idle column
(c)

Slack column
(d)

Dummy Column
Answer:

Option (d)

4.

In a transportation problem where the demand or requirement is equal to the available resource

is known as

(a)

Balanced transportation problem
(b)

Regular transportation problem
(c)

Resource allocation transportation problem
(d)

Simple transportation model
Answer:

Option (a)

5.

When the total allocations in a transportation model of m×n size do not equal to m+n-1 the situation is known as

(a)

Unbalanced situation
(b)

Tie situation
(c)

Degeneracy
(d)

None of the above
Answer:

Option (c)

6.

The penalty of a row in a transportation problem is obtained by

(a)

Deducting the smallest element in the row from all other elements of the row
(b)

Adding the smallest element in the row to all other elements of the row
(c)

Deducting the smallest element in the row from the next highest element of the row
(d)

Deducting the smallest element in the row from the highest element in that row
Answer:

Option (c)

7.

In the Northwest corner method the allocations are made

(a)

Starting from the left-hand side top corner
(b)

Starting from the right-hand side top corner
(c)

Starting from the lowest cost cell
(d)

Starting from the lowest requirement and satisfying first
Answer:

Option (a)

8.

In transportation Problems, VAM stands for .........................

(a)

Value Addition Method
(b)

Vogel’s Approximation Method
(c)

Virgenean Approximation Method
(d)

None of these
Answer:

Option (b)

9.

MODI stands for

(a)

Modern Distribution
(b)

Mendel's Distribution Method
(c)

Modified Distribution Method
(d)

Model Index Method
Answer:

Option (c)

10.

In the optimal solution, more than one empty cells have their opportunity cost as zero, it indicates

(a)

The solution is not optimal
(b)

The problem has alternate solution
(c)

Something wrong in the solution
(d)

The problem will cycle
Answer:

Option (b)

Showing 1 to 10 out of 38 Questions
1 2 3 4