The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are

Related MCQs

• A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is
• 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:
• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• The dummy source or destination in a transportation problem is added to
• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
• A feasible solution to a linear programming problem
• A feasible solution to an LP problem
• Every basic feasible solution of a general assignment problem, having a square pay-off matrix of order, n should have assignments equal to
• To use the transportation simplex method, a transportation problem that is unbalanced requires the use of