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

1. m+n

2. m*n

3. m+n-1

4. m+n+1

  • c. m+n-1
Subscribe Now

Get All Updates & News