6 -1 CHAPTER 6 TRANSPORTATION AND ASSIGNMENT PROBLEMS Review Questions 6.1-1 The CEO is concerned about escalating costs, in particular the shipping costs for peas. 6.1-2 Kim Baker is being asked to look at the current shipping plan and see if they can develop a new one that would reduce the total shipping cost to an absolute minimum. 6.2-1 Transportation problems in general are concerned with distributing any commodity from any group of supply centers, called sources, to any group of receiving centers, called destinations, in such a way as to minimize the total distribution cost. 6.2-2 The data needed for a transportation problem are the supplies, demands, and unit costs. 6.2-3 Formulating a problem as a transportation problem only requires filling out a table in the format of Table 6.5. 6.2-4 A transportation problem will have feasible solutions if and only if the sum of its supplies equals the sum of its demands. 6.2-5 As long as all its supplies and demands have integer values, any transportation problem with feasible solutions is guaranteed to have an optimal solution with integer values for all its decision variables. 6.2-6 The transportation simplex method and network simplex method can solve them faster. 6.3-1 A ≤ sign instead of an = sign is used in the respective cells and the corresponding constraints in the Solver dialog box. 6.3-2 Instead of a demand row, there is both a minimum row and a maximum row. Then constraints are entered so that Shipped ≥ Minimum and Shipped ≤ Maximum. 6.4-1 The areas of application in this section are distributing natural resources, production scheduling, designing school attendance zones, meeting energy needs, and choosing a new site location. 6...
VIP
