The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.

The solution to a transportation problem with ‘m’ rows (supplies)

1.	The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.
A.	+n
B.	*n
C.	+n-1
D.	+n+1
Answer» D. +n+1