Question

(ii)The solution to a transportation problem with m-rows (supplies) and n-
columns (destination) is feasible if number of positive allocations are
(a) m+n
(b) mxn
(c) m+n-1
(d) m+n+12
.​

Answer 1

Answer:

dsnj*s@idwiwushs&wiiu

Answer 2

Answer:

C

The number of positive allocations must be equal to m+n-1, where m is the number of rows and n is the number of columns.

Explanation: