Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐

Related MCQs

• Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
• Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations
• Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A non – degenerate basic feasible solution is the basic feasible solution which has exactly m positive Xi (i=1,2,…,m), i.e., none of the basic variable is ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• A feasible solution is called a basic feasible solution if the number of non‐negative allocations is equal to ‐‐‐‐‐‐‐‐‐‐‐‐‐‐
• 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