the cells ( O , D ), ( O , D ), ( O , D ) Allocate min ( , ) = units to this cell. D D a i O ( ) / O b j / The reduced table is D a i O b j Here allocate units in the cell ( O , D ) D a i O ( ) / b j / Thus we have the following allocations: D D D D a i O ( ) ( ) / / O ( ) / O ( ) ( ) / / b j / / / / / Transportation schedule : O à D , O à D , O à D , O à D , O à D Total transportation cost = ( × )+ ( × )+( × )+( × )+( × ) = + + + + = ` . Example . Determine how much quantity should be stepped from factory to various destinations for the following transportation problem using the least cost method.
Destination Factory H K Capacity T M Demand Cost are expressed in terms of rupees per unit shipped. Total Capacity = Total Demand ∴ The given problem is balanced transportation problem. Hence there exists a feasible solution to the given problem. XII Std - Business Maths & Stat EM Chapter - - Given Transportation Problem is Destination Factory H K Capacity ( a i ) T M Demand ( b j ) First Allocation: H K a i T ( ) / M b j / Second Allocation: H K a i T ( ) / ( ) / M b j / / Third Allocation: H K a i T ( ) / ( ) / M ( ) / b j / / / Fourth Allocation: H K a i T ( ) ( ) / / ( ) / M ( ) / b