GATE Papers >> Mechanical >> 2008 >> Question No 58

Question No. 58 Mechanical | GATE 2008

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 xij values (amounts from source i to destination j) is desired. The best upper bound for this number is

Answer : (D) m + n -1

No Comments
Leave a comment