The number of units shipped from origin i to destination j is represented by

Related MCQs

• The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are
• The number of units expected to be sold is uniformly distributed between 300 and 500. If r is a random number between 0 and 1, then the proper expression for sales is
• The dummy source or destination in a transportation problem is added to
• Performance measures dealing with the number of units in line and the time spent waiting are called
• 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:
• The northwest corner rule requires that we start allocating units to shipping routes in the:
• The manner in which units receive their service, such as FCFS, is the
• 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
• Infeasibility means that the number of solutions to the linear programming models that satisfies all constraints 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