be made arbitrarily. Note Example . Obtain an initial basic feasible solution to the following transportation problem using least cost method. D D D D Supply O O O Demand Here O i and D j denote i th origin and j th destination respectively.
Total Supply = Total Demand = ∴ The given problem is a balanced transportation problem. Hence there exists a feasible solution to the given problem. Given Transportation Problem is: D D D D Supply ( a i ) O O O Demand ( b j ) The least cost is corresponds to the cells ( O , D ) and ( O , D ) Take the Cell ( O , D ) arbitrarily. Allocate min ( , ) = units to this cell.
D D D D a i O ( ) / O O b j / The reduced table is D D D a i O O O b j The least cost corresponds to the cell (O , D ). Allocate min ( , ) = units to this cell. D D D a i O O O ( ) / b j / The reduced table is D D a i O O O b j The least costis corresponds to the cells ( O , D ), ( O , D ), ( O , D ), ( O , D ) XII Std - Business Maths & Stat EM Chapter - - Operations Research Allocate min ( , ) = units to this cell. D D a i O ( ) / O O b j / The reduced table is D D a i O O bj The least cost is corresponds to