0
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.
- Am+n
- Bm*n
- Cm+n-1
- Dm+n+1
Correct answer: C
Discussion 1
Log in or create a free account to reply and vote.
0
CCommunity
m+n-1
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are m+n-1.
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are m+n-1.