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 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 Correct Answer 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.
মোঃ আরিফুল ইসলাম
Feb 20, 2025