The document describes the Modi method for solving transportation problems. It involves finding the unused route with the largest negative improvement index to determine the best way to ship units. The key steps are to construct a transportation table, find the initial basic feasible solution, identify occupied and unoccupied cells, calculate opportunity costs for unoccupied cells, select the cell with the largest negative opportunity cost, and assign units until reaching the optimal solution. The method is demonstrated on two example problems.
7. . PROBLEM1:Shipping costs are Rs. 10 per kilometer.. What shipping schedule should be used. if the matrix given below the kilometers from source to destination. Requirement 3 3 2 8 x 50 30 220 1 y 90 45 170 3 z 50 200 50 4 destination a b c availability
8. A B C X Y Z 30 220 50 90 45 170 50 200 50 30 220 1 2 3 2 2 2 2 3 P1 P2 P3 P4 20 20 20 20 45 45 45 _ 150 150 _ _ P1 40 15 120 P2 40 15 _ P3 40 15 _ IBFS BY USING VAM METHOD
9. 30 30 220 90 45 170 50 200 50 1 E 3 2 2 STONE SEQUARE =4 RIM REQUIREMENT =M+N-1=3+3-1=5 DEGENERACY NOW STONE SEQUARE =5 RIM REQUIREMENT =5 NON –DEGENERACY