To solve degeneracy in the transportation problem we have to: a Put allocation in one of the empty cells as zero, b Put a small element epsilon in any one of the empty cells, c Allocate the smallest element epsilon in such a cell, which will not form a closed loop with other loaded cells, d Allocate the smallest element epsilon in such a cell, which will form a closed loop with other loaded cells. The similarity between Assignment Problem and Transportation Problem is: a Both are rectangular matrices, b Both are square matrices, c Both can be solved by graphical method, d Both have objective function and nonnegativity constraints. Operations Research The following statement applies to both transportation model and assignment model a The inequalities of both problems are related to one type of resource, b Both use VAM for getting basic feasible solution, c Both are tested by MODI method for optimality, d Both have objective function, structural constraint and nonnegativity constraints. To test whether allocations can be made or not in assignment problem minimum number of horizontal and vertical lines are drawn. In case the lines drawn is not equal to the number of rows or columns to get additional zeros, the following operation is done: a Add smallest element of the uncovered cells to the elements to the line, b Subtract smallest element of uncovered rows from all other elements of uncovered cells, c Subtract the smallest element from the next highest number in the element, d Subtract the smallest element from the element at the intersection of horizontal and vertical lines.

Answer rating: 100% (QA)

1 The correct option to solve degeneracy in the transportation problem is c Allocate the smallest el... View the full answer