Transportation

P A Q

B

R

C

S

Transportation The figures in the matrix are the costs of transportation Plant Av’lty Warehouse Demand 20 95 D E A B 35 F 50 6 3 4 4 8 4 1 7 2 40 60 C .

Transportation 1. 3. Vogel’s Approximation Method. All the above methods gives us an initial feasible basic solution. . We need to do iterations do ensure that the allocations made are optimal – i. Least Cost Method.e. N-W Corner rule. They need to be tested for optimatility. it results in the least cost for transporting. 2.

Transportation We have two methods – Stepping stone method Modified Distribution or MODI Method In both cases we change the allocations and verify that the allocations result in least cost. .

40 & 80. Costs are as under. A B C D E X 5 8 6 6 3 Y 4 7 7 6 6 Z 8 4 6 6 3 Minimise the Transport cost. 50 & 90 feed five locations 40. Trans.50.Transportation Three Plants with capacities 80. .40.

Maximisation Four Factories make the same product. requirements and sales prices are given below F1 F2 F3 F4 SP Reqt Prodn cost 15 18 14 13 R. S1 3 9 5 4 34 80 Cost S2 1 7 4 5 32 120 Per Unit S3 5 8 3 6 31 150 Supply 10 150 50 100 .Cost/unit 10 9 12 9 Trans.Transportation . The production parameters.

We use dummy rows or columns and allocate the excess to a dummy cell and ignore the value in that cell. Degeneracy is a state which makes it impossi ble for us to use the MODI method for solution.Transportation When the supply and demand do not match – we have an unbalanced transportation problem. .

we make an allocation.This happens when the number of allocations in the initial feasible solution does not give us (m+n-1) number of allocations.which isinfitisemal for purposes of calculation and ignore it. Just as we did in the imbalanced problems. once we get the solution. .

.Then we have cases of preferred and prohibited routes.

3/ 574-90/74:908  .8084157010770/...0.%030.