Difficulty: Easy
Correct Answer: Balanced Transportation Problem
Explanation:
Introduction / Context:In Operations Research, the Transportation Problem allocates shipments from multiple origins (suppliers) to multiple destinations (customers) at minimum cost while respecting supply and demand constraints. A key diagnostic before solving is whether the problem is balanced or unbalanced, because that choice determines if we must add a dummy source or destination and which methods apply directly without modification.
Given Data / Assumptions:
Concept / Approach:A Balanced Transportation Problem is defined by the equality: sum of supplies = sum of demands. When this holds, the model can be solved directly by methods like Northwest Corner, Least Cost, or Vogel’s Approximation to get a starting solution, and then optimized with Stepping Stone or MODI without introducing dummy rows/columns. If totals differ, the model is Unbalanced and requires a dummy source or destination to reconcile the totals before proceeding.
Step-by-Step Solution:
Compute total_supply = sum of all origin supplies. Compute total_demand = sum of all destination demands. Compare totals: if total_supply == total_demand, the problem is balanced. Conclude the correct term is Balanced Transportation Problem.Verification / Alternative check:Attempt to set up the linear program. If all constraints can be written without slack from a dummy node and the equality condition holds, the instance is balanced by definition.
Why Other Options Are Wrong:
Common Pitfalls:Forgetting to add a dummy node when the problem is unbalanced; misclassifying degeneracy as balance/unbalance.
Final Answer:Balanced Transportation Problem
Discussion & Comments