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
D)m+n+1

Question

Quizplus · Accepted Answer

The solution to a transportation problem is feasible if the number of positive allocations does not exceed m + n - 1, where m is the number of rows (supplies) and n is the number of columns (destinations). This is based on the concept that a basic feasible solution to a transportation problem requires exactly m + n - 1 allocations (assuming there are no degeneracies), which aligns with the number of equations needed to satisfy the supply and demand constraints without being redundant.

The Solution to a Transportation Problem with 'M' Rows (Supplies)