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

A closed path has all the following characteristics except:

The path may skip over unused squares or stones

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

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

It links an unused square with itself

Degeneracy occurs in a transportation problem when

None of the above

When less than m + n – 1 cells are used

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

Demand exceeds supply

An unbalanced transportation problem is the one in which

None of the above

The total supply is same as total requirement

The total supply is not equal to total requirement

The number of jobs are not equal to number of facilities

The MODI method uses the stepping stone path

None of the above

To determine the values of the row and column indexes

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

To calculate the marginal cost of unused cells

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

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

The minimum number in an increasing cell

The minimum number in any cell

The maximum number in any cell

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

None of the above

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

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

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

The North West Corner rule

None of the above

Is based on the concept of minimizing opportunity cost

Is used to find optimal solution

Is used to find an initial feasible solution

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

Either of the above

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

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

The close path indicates a diagonal move

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

Any value

Most positive number

Most negative number

Equal to zero

An unoccupied cell in the transportation method is analogous to a

Value in the B-column in the simplex method

Variable not in the B-column in the simplex method

Variable in the B-column in the simplex method

Cj – Zj value in the simplex method

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

None of the above

Variable in the B- column in the simplex method

Value of a variable in XB column of the simplex method

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

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

m + n + 1

m + n – 1

m * n

m + n

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

All of the above

It leads to a degenerate initial solution

It does not take into account cost of transportation

It is complicated to use

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

None of the above

Negative with at least one equal to zero

Positive with at least one equal to zero

Positive and greater than zero

The occurrence of degeneracy while solving a transportation problem means that

None of the above

The few allocations become negative

The solution so obtained is not feasible

Total supply equals total demand

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

None of the above

Ensure that total cost does not exceed a limit

Prevent solution from becoming degenerate

Satisfy rim conditions

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

All of the above

The solution not be degenerate

The rim conditions are satisfied

The solution be optimal

The path may skip over unused squares or stones

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

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

It links an unused square with itself

Degeneracy occurs in a transportation problem when

None of the above

When less than m + n – 1 cells are used

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

Demand exceeds supply

An unbalanced transportation problem is the one in which

None of the above

The total supply is same as total requirement

The total supply is not equal to total requirement

The number of jobs are not equal to number of facilities

The MODI method uses the stepping stone path

None of the above

To determine the values of the row and column indexes

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

To calculate the marginal cost of unused cells

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

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

The minimum number in an increasing cell

The minimum number in any cell

The maximum number in any cell

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

None of the above

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

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

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

The North West Corner rule

None of the above

Is based on the concept of minimizing opportunity cost

Is used to find optimal solution

Is used to find an initial feasible solution

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

Either of the above

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

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

The close path indicates a diagonal move

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

Any value

Most positive number

Most negative number

Equal to zero

An unoccupied cell in the transportation method is analogous to a

Value in the B-column in the simplex method

Variable not in the B-column in the simplex method

Variable in the B-column in the simplex method

Cj – Zj value in the simplex method

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

None of the above

Variable in the B- column in the simplex method

Value of a variable in XB column of the simplex method

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

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

m + n + 1

m + n – 1

m * n

m + n

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

All of the above

It leads to a degenerate initial solution

It does not take into account cost of transportation

It is complicated to use

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

None of the above

Negative with at least one equal to zero

Positive with at least one equal to zero

Positive and greater than zero

The occurrence of degeneracy while solving a transportation problem means that

None of the above

The few allocations become negative

The solution so obtained is not feasible

Total supply equals total demand

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

None of the above

Ensure that total cost does not exceed a limit

Prevent solution from becoming degenerate

Satisfy rim conditions

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

All of the above

The solution not be degenerate

The rim conditions are satisfied

The solution be optimal

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

325 days 21 hours 46 minutes ago

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

1600 days 3 hours 3 minutes ago

**
Economic Analysis: India**

50 Questions
| 1186 Attempts

**
Indian Economy : An Overview**

50 Questions
| 584 Attempts

**
India: An Overview of Economy**

50 Questions
| 338 Attempts

Post Cancel