Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations

Related MCQs

• Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations
• Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
• Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
• The operations Research technique which helps in minimizing total waiting and service costs is
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• State which of the two statements is correct (i) the cells in the transportation table can be classified in to occupied cells and unoccupied cells (ii) optimal solution is a feasible solution (not necessarily basic ) which maximizes the total cost
• To find initial feasible solution of a transportation problem the method which starts allocation from the lowest cost is called method
• When the total of allocations of a transportation problem match with supply and demand values, the solution is called solution.
• Which of the following considers difference between two least costs for each row and column while finding initial basic feasible solution in transportation?
• If M + N – 1 = Number of allocations in transportation, it means . (Where ‘M’ is number of rows and ‘N’ is number of columns)