The dummy source or destination in a transportation problem is added to

Related MCQs

• To proceed with the MODI algorithm for solving an assignment problem, the number of dummy allocations need to be added are
• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations 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
• To use the transportation simplex method, a transportation problem that is unbalanced requires the use of
• An alternative optimal solution to a minimization transportation problem exists whenever opportunity cost corresponding to unused route of transportation is:
• The purpose of a dummy row or column in an assignment problem is to
• 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