A set of non-negative values that satisfies the constants in a transportation problem is a ___________

(a)

Basic feasible solution

(b)

Feasible solution

(c)

Optimal solution

(d)

Non degenerate basic feasible solution

The total transportation cost is ___________

(a)

55

(b)

102

(c)

101

(d)

50

In least cost method if the minimum cost is not unique then the choice can be made as ___________

(a)

arbitrarily

(b)

unique

(c)

difference

(d)

summation

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

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

_____determines the highest out come for each alternative.

(a)

Maximum cost

(b)

Minimax criteria

(c)

Maximin criteria

(d)

Payoff

Operation research is an analytical method of ___________

(a)

problem solving

(b)

decision making

(c)

optimal cost of transportation

(d)

unit cost of transportation

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 given data is a balanced transportation problem

Then total demand
 

(a)

7 + 9 + 18

(b)

9 + 7 + 10 + 8

(c)

15+ 15 + 4

(d)

10+ 10+ 14

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

The penalty is the difference between the ___ costs in each row and column.

(a)

smallest

(b)

biggest

(c)

minimum

(d)

least