A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is

Related MCQs

• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• In a transportation problem, when the number of occupied routes is less than the number of rows plus the number of columns -1, we say that the solution is:
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• The stepping-stone method requires that one or more artificially occupied cells with a flow of zero be created in the transportation tableau when the number of occupied cells is fewer than
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
• The large negative opportunity cost value in an unused cell in a transportation table is chosen to improve the current solution because
• To use the transportation simplex method, a transportation problem that is unbalanced requires the use of
• The only restriction can be placed on the initial solution of a transportation problem is that:
• The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that