SKEDSOFT

The basic feasible solution is having four loaded cells. As the number of columns is 3 and number of rows is 2 the total number of allocations must be 2 3 – 1 = 4. The solution got has four allocations. Hence the basic feasible solution. Now let us give optimality test by MODI method.

Row numbers ui s and column numbers vj s is written in the matrix and opportunity costs of empty cells are evaluated. As the opportunity costs of all empty cells are negative, the solution is optimal. The allocations and the total cost of transportation are:

This is the required solution of degeneracy problem.