In a non – degenerate solution number of allocations is _______.

(a)

Equal to m+n–1

(b)

Equal to m+n+1

(c)

Not equal to m+n–1

(d)

Not equal to m+n+1

The Penalty in VAM represents difference between the first ________.

(a)

Two largest costs

(b)

Largest and Smallest costs

(c)

Smallest two costs

(d)

None of these

In an assignment problem the value of decision variable x_ij is ______.

(a)

1

(b)

0

(c)

1 or 0

(d)

none of them

The purpose of a dummy row or column in an assignment problem is to _______.

(a)

prevent a solution from becoming degenerate

(b)

balance between total activities and total resources

(c)

provide a means of representing a dummy problem

(d)

none of the above

In an assignment problem involving four workers and three jobs, total number of assignments possible are _______.

(a)

4

(b)

3

(c)

7

(d)

12

The total transportation cost is ___________

(a)

55

(b)

102

(c)

101

(d)

50

Vogel's approximation method yields an initial basic feasible solution which is very close to the solution.

(a)

maximum

(b)

minimum

(c)

optimum

(d)

unique

______ method provides optimum assignment schedule in an assignment problem.

(a)

North West Corner

(b)

Least cost

(c)

Vogel's Approximation Method

(d)

Hungarian Method

The methods of funding feasible solution to a transportation problem ___________

(a)

North West Corner Rule

(b)

Least Cost Method

(c)

Hungarian Method

(d)

Vogel's Approximation Method

The least cost method is more economical than North West Corner Rule, since it starts with the ___________

(a)

least cost

(b)

minimum cost

(c)

maximum cost

(d)

lower beginning cost