To assign different jobs to the different machines to minimize the overall cost is ___________

(a)

transportation problem

(b)

assignment problem

(c)

minimax principle

(d)

maximin principle

The optimum_______schedule remains, unaltered if we add or subtract a constant from all the elements of the row or which of the cost________matrix.

(a)

transportation

(b)

assignment

(c)

unique

(d)

optimal

If the number of rows is____tothenumber of columns, then the assignment problem is said to be balanced.

(a)

equal

(b)

less

(c)

more

(d)

not equal

______ method provides optimum assignment schedule in an assignment problem.

(a)

North West Corner

(b)

Least cost

(c)

Vogel's Approximation Method

(d)

Hungarian Method

_____determines the lowest out comes for each alternative.

(a)

Least cost

(b)

Minimax criteria

(c)

Maximin criteria

(d)

Payoff matrix