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

For the standard transportation linear programme with m sources and n

1.	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
A.	mn
B.	2 (m + n)
C.	m + n
D.	m + n - 1
Answer» E.