Question

25. The Transportation problem is to transport various amounts of a single homogenious commodity that the total transportation cost is

(A) minimum

(B) maximum

(C) may or may not be minimum

(D) none of these



​

Answer 1

Answer:

A set of non-negative allocations xij ≥ 0 which satisfies the row and column restrictions is known as feasible solution. Basic Feasible Solution. A feasible solution to a m-origin and n-destination problem is said to be basic. feasible solution if the number of positive allocations are (m+n–1).