A basic feasible solution of an m × n transportation problem is said to be non-degenerate, if basic feasible solution contains exactly _______ number of individual allocations in ______ positions.

Concept:

Transportation problem is crucial part of linear programming problem which can be connected for required sources of supply to corresponding destination of demand, with the end goal that the aggregate transportation cost to be limited.

Explanation:

The essential phase of any transportation problem as initial basic feasible solution.

• Initial basic feasible solution must be feasible i.e. it must satisfy all the supply and demand constraints.
• The number of positive allocations must be equal to m+n-1 where m is number of rows and n is number of columns.

Nondegenerate basic feasible solution: A basic feasible solution is non – degenerate if it has exactly m+n-1 positive allocations in individual positions. If the allocations are less than required number, then it is known as degenerate basic feasible solution. This solution is not easy to modify, because it is impossible to draw a closed loop for each occupied cell.