the second column is exhausted. i.e. x = min ( , ) = a i ( ) / b j / Reduced transportation table is a i b j Here north west corner cell is ( , B ). Allocate as much as possible in the first cell so that either the capacity of third row is exhausted or the destination requirement of the second column is exhausted.
i.e. x = min ( , ) = a i ( ) / b j / Reduced transportation table is a i b j XII Std - Business Maths & Stat EM Chapter - - Here north west corner cell is ( ,C) Allocate as much as possible in the first cell so that either the capacity of third row is exhausted or the destination requirement of the third column is exhausted. i.e. x = min ( , ) = a i ( ) / b j / Reduced transportation table and final allocation is x = a i ( ) / b j / Thus we have the following allocations a i ( ) ( ) ( ) ( ) ( ) ( ) b j Transportation schedule : à A , à A , à B , à B , à C , à C The total transportation cost.
= ( ) + ( ) +( )+( )+ ( ) + ( ) = ` Example . Determine an initial basic feasible solution to the following transportation problem using North West corner rule. O O O Require- ment D D D D Availability Here O i and D j represent i th origin and j th destination. Solution : Given transportation table is D D D D Availability ( a i ) O O O Requirement ( b j ) Total Availability Total Requirement.
Therefore the given problem is balanced transportation problem. Hence there exists a feasible solution to the given problem. First allocation: D