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

Related MCQs

• 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:
• To use the transportation simplex method, a transportation problem that is unbalanced requires the use of
• In the simplex method, a tableau is optimal only if all the cj – zj values are
• A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table is
• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• An optimal assignment requires that the maximum number of lines that can be drawn through squares with zero opportunity cost be equal to the number of
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• The per-unit change in the objective function associated with assigning flow to an unused arc in the transportation simplex method is called the
• Identifying the outgoing arc in Phase II of the transportation simplex method is performed using the
• The initial solution of a transportation problem can be obtained by applying any known method. However, the only condition is that