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