Question

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 x_ij 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

Answer 1

Correct Answer - Option 4 : m + n - 1

Explanation:

• Feasible solution: A set of non-negative individual allocation which satisfies all the given constraints is termed as feasible solution.
• Basic feasible solution:  In an m × n transportation problem, if total no. of allocation is exactly equal to (m + n - 1), then that feasible solution is known as basic feasible solution.