?
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are.
Answer & Solution
Correct Answer:
Option
C
The solution to a transportation problem with ‘m’ rows (supplies) & ‘n’ columns (destination) is feasible if number of positive allocations are m+n-1.
Join the Discussion
Login to post a comment or share your explanation.
Login