SKEDSOFT

Solution by Least cost cell (or inspection) Method: (Matrix Minimummethod)

• Identify the lowest cost cell in the given matrix. In this particular example it is = 0. Four cells of dummy column are having zero. When more than one cell has the same cost, then both the cells are competing for allocation. This situation in transportation problem is known as tie.
• To break the tie, select any one cell of your choice for allocation. Make allocations to this cell either to satisfy availability constraint or requirement constraint. Once one of these is satisfied, then mark crosses (×) in all the cells in the row or column which ever has completely allocated.
• Next search for lowest cost cell. In the given problem it is cell BZ which is having cost of Re.1/- Make allocations for this cell in similar manner and mark crosses to the cells in row or column which has allocated completely.
• Proceed this way until all allocations are made. Then write allocations and find the cost of transportation. As the total numbers of allocations are 7 which are equals to 4 4 – 1 = 7, the solution is basic feasible solution