Transportation Problem

1. A given TP is said to be unbalanced, if the total supply is not equal to the total ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
4. The allocated cells in the transportation table are called ‐‐‐‐‐‐‐‐‐‐‐‐‐
8. For maximization in TP, the objective is to maximize the total ‐‐‐‐‐‐‐‐‐‐
11. If demand is lesser than supply then dummy demand node is added to make it a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
12. The solution of any transportation problem is obtained in how many stages?
13. An optimal solution is the ‐‐‐‐‐‐‐‐‐‐‐ stage of a solution obtained by improving the initial solution.
15. If the total supply is less than the total demand, a dummy source (row) is included in the cost matrix with ‐‐‐‐‐‐‐‐‐‐‐‐‐

2. To find the optimal solution, we apply ‐‐‐‐‐‐‐‐‐‐
3. Any feasible solution to a transportation problem containing m origins and n destinations is said to be ‐‐‐‐‐‐‐‐‐‐‐‐‐
5. A path formed by allowing horizontal and vertical lines and the entire corner cells of which are occupied is called a ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐
6. Once the initial basic feasible solution has been computed , what is the next step in the problem
7. Optimal solution is a feasible solution which minimizes the ‐‐‐‐‐‐‐‐‐‐
9. For solving an assignment problem, which method is used?
10. One can find the initial basic feasible solution by using ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ ?
14. Transportation algorithm can be used for minimizing the transportation cost of ‐‐‐‐‐‐‐‐‐‐‐‐ from O origins and D destinations