-
For the standard transportation linear program with m sources and n destinations and total supply equaling total demand, an optimal solution (lowest cost) with the smallest number of non-zero xij values (amounts from source i to destination j) is desired. The best upper bound for this number is
-
- m n
- 2(m + n)
- m + n.
- m + n – 1
Correct Option: C
In such an L.P.P, m × n variables are there and m + n equations/constraints are there (satisfying the demand-supply requirements). But one constraint is removed as total supply equals total demand. The best upper bound xij values is (m + n – 1).
