Multiple choice

For the standard transportation linear programme with m sources and n destinations and total supply equaling total demand, an optimal solution(lowest cost) with the smallest number of non-zero x0 values (amounts from source I to destination j) is desired. The best upper bound for this number is

  1. mn

  2. 2 (m + n)

  3. m + n

  4. m + n - 1
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

Keep practicing — related questions