CHAPTER 5
TRANSPORTATION, ASSIGNMENT, AND NETWORK
MODELS
SOLUTIONS TO DISCUSSION QUESTIONS
5-1. The transportation model is an example of decision making under certainty since the costs of each
5-2. A balanced transportation problem is one in which total demand (from all destinations) is exactly
5-3. The enumeration method is not a practical means of solving 5 x 5 or 7 x 7 problems because of the
5-4. The minimal-spanning model is one that will find the best way to connect all the nodes in a network
together while minimizing the total distance between nodes or the total cost of connecting the nodes
5-5. The maximal-flow model can be used to determine the maximum number of cars that can flow
through a road system, the number of gallons of chemicals that can flow through a chemical processing
5-6. The shortest-path model can be used to find the best way to install a phone cable between two major
5-7. A flow balance constraint calculates the net flow at a node (that is, the difference between the total
flow on all arcs entering the node and the total flow on all arcs leaving the node). At each source node,
5-9. For many network models, the number of arcs (each of which corresponds to a decision variables)
5-10. To specify the entire table as the Changing Cells in Solver for a maximal-flow network model, we
5-11. To specify the entire table as the Changing Cells in Solver for a shortest-path network model, we