JavaScript is disabled on your browser. Enable JavaScript to use this site. Learn more

A closed path has all the following characteristics except:

It links an unused square with itself

Movements on the path may occur horizontally, vertically, or diagonally

The corners of the path must all be stones, except for the corner at the unused square being evaluated

The path may skip over unused squares or stones

Degeneracy occurs in a transportation problem when

Demand exceeds supply

When exactly one used cell becomes unused while moving items to a currently used cell

When less than m + n – 1 cells are used

None of the above

An unbalanced transportation problem is the one in which

The number of jobs are not equal to number of facilities

The total supply is not equal to total requirement

The total supply is same as total requirement

None of the above

The MODI method uses the stepping stone path

To calculate the marginal cost of unused cells

To determine how many items to allocate to the selected unused cell

To determine the values of the row and column indexes

None of the above

The maximum number of items that can be allocated to an unused route with the stepping stone algorithm is

The maximum number in any cell

The minimum number in any cell

The minimum number in an increasing cell

The minimum number in a decreasing cell on the stepping- stone path for that route

In Vogel’s approximation method, the opportunity cost associated with a row is determined by :

The difference between the smallest cost and the next smallest cost in that row

The difference between the smallest unused cost and the next in that row

The difference between the smallest cost and the next smallest unused cost in the row

None of the above

The North West Corner rule

Is used to find an initial feasible solution

Is used to find optimal solution

Is based on the concept of minimizing opportunity cost

None of the above

During an iteration while moving from one solution to the next, degeneracy may occur when

The close path indicates a diagonal move

Two or more occupied cells are on the closed path but neither of them represents a corner of the path

Two or more occupied cells on the closed path with minus sign are tied for lowest circled value

Either of the above

If we were to use opportunity cost value for an unused cell to test optimality, it should be

Equal to zero

Most negative number

Most positive number

Any value

An unoccupied cell in the transportation method is analogous to a

Cj – Zj value in the simplex method

Variable in the B-column in the simplex method

Variable not in the B-column in the simplex method

Value in the B-column in the simplex method

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

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

Value of a variable in XB column of the simplex method

Variable in the B- column in the simplex method

None of the above

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

m + n

m * n

m + n – 1

m + n + 1

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

It is complicated to use

It does not take into account cost of transportation

It leads to a degenerate initial solution

All of the above

An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:

Positive and greater than zero

Positive with at least one equal to zero

Negative with at least one equal to zero

None of the above

The occurrence of degeneracy while solving a transportation problem means that

Total supply equals total demand

The solution so obtained is not feasible

The few allocations become negative

None of the above

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

Satisfy rim conditions

Prevent solution from becoming degenerate

Ensure that total cost does not exceed a limit

None of the above

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

The solution be optimal

The rim conditions are satisfied

The solution not be degenerate

All of the above

It links an unused square with itself

Movements on the path may occur horizontally, vertically, or diagonally

The corners of the path must all be stones, except for the corner at the unused square being evaluated

The path may skip over unused squares or stones

Degeneracy occurs in a transportation problem when

Demand exceeds supply

When exactly one used cell becomes unused while moving items to a currently used cell

When less than m + n – 1 cells are used

None of the above

An unbalanced transportation problem is the one in which

The number of jobs are not equal to number of facilities

The total supply is not equal to total requirement

The total supply is same as total requirement

None of the above

The MODI method uses the stepping stone path

To calculate the marginal cost of unused cells

To determine how many items to allocate to the selected unused cell

To determine the values of the row and column indexes

None of the above

The maximum number of items that can be allocated to an unused route with the stepping stone algorithm is

The maximum number in any cell

The minimum number in any cell

The minimum number in an increasing cell

The minimum number in a decreasing cell on the stepping- stone path for that route

In Vogel’s approximation method, the opportunity cost associated with a row is determined by :

The difference between the smallest cost and the next smallest cost in that row

The difference between the smallest unused cost and the next in that row

The difference between the smallest cost and the next smallest unused cost in the row

None of the above

The North West Corner rule

Is used to find an initial feasible solution

Is used to find optimal solution

Is based on the concept of minimizing opportunity cost

None of the above

During an iteration while moving from one solution to the next, degeneracy may occur when

The close path indicates a diagonal move

Two or more occupied cells are on the closed path but neither of them represents a corner of the path

Two or more occupied cells on the closed path with minus sign are tied for lowest circled value

Either of the above

If we were to use opportunity cost value for an unused cell to test optimality, it should be

Equal to zero

Most negative number

Most positive number

Any value

An unoccupied cell in the transportation method is analogous to a

Cj – Zj value in the simplex method

Variable in the B-column in the simplex method

Variable not in the B-column in the simplex method

Value in the B-column in the simplex method

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

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

Value of a variable in XB column of the simplex method

Variable in the B- column in the simplex method

None of the above

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

m + n

m * n

m + n – 1

m + n + 1

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

It is complicated to use

It does not take into account cost of transportation

It leads to a degenerate initial solution

All of the above

An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:

Positive and greater than zero

Positive with at least one equal to zero

Negative with at least one equal to zero

None of the above

The occurrence of degeneracy while solving a transportation problem means that

Total supply equals total demand

The solution so obtained is not feasible

The few allocations become negative

None of the above

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

Satisfy rim conditions

Prevent solution from becoming degenerate

Ensure that total cost does not exceed a limit

None of the above

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

The solution be optimal

The rim conditions are satisfied

The solution not be degenerate

All of the above

This paper has 17 questions which are required to be finished within 20-25 minutes.

The solution to a transportation problem with m - row and n - columns is feasible if number of positive allocations are

516 days 15 hours 20 minutes ago

THE MOST LUCRATIVE JOB IS SELFEMPLOY.GET RAPID ECONOMICS DEVELOPMENT IS TO LIVE A SIMPLE AND SHARE WHATEVER WITH OTHERS

1790 days 20 hours 37 minutes ago

**
Economic Analysis: India**

50 Questions
| 1201 Attempts

**
Indian Economy : An Overview**

50 Questions
| 619 Attempts

**
India: An Overview of Economy**

50 Questions
| 341 Attempts

Post Cancel