To use the transportation simplex method, a transportation problem that is unbalanced requires the use of

Related MCQs

• Using the transportation simplex method, the optimal solution to the transportation problem has been found when
• 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
• A solution to a transportation problem that has less than m + n − 1 cells with positive allocations in the transportation table 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
• When total supply is equal to total demand in a transportation problem, the problem is said to be
• An assignment problem is considered as a particular case of a transportation problem because
• An assignment problem is a special case of transportation problem, where
• In the simplex method, a tableau is optimal only if all the cj – zj values are