This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 10: TRANSPORTATION, TRANSSHIPMENT PROBLEMS MULTIPLE CHOICE 1. The problem which deals with the distribution of goods from several sources to several destinations is the a. maximal flow problem b. transportation problem c. assignment problem d. shortest-route problem 2. The parts of a network that represent the origins are a. the capacities b. the flows c. the nodes d. the arcs 3. The objective of the transportation problem is to a. identify one origin that can satisfy total demand at the destinations and at the same time minimize total shipping cost. b. minimize the number of origins used to satisfy total demand at the destinations. c. minimize the number of shipments necessary to satisfy total demand at the destinations. d. minimize the cost of shipping products from several origins to several destinations. 4. The number of units shipped from origin i to destination j is represented by a. x ij . b. x ji . c. c ij . d. c ji . 5. Which of the following is not true regarding the linear programming formulation of a transportation problem? a. Costs appear only in the objective function. b. The number of variables is (number of origins) x (number of destinations). c. The number of constraints is (number of origins) x (number of destinations). d. The constraints left-hand side coefficients are either 0 or 1. 6. The difference between the transportation and assignment problems is that a. total supply must equal total demand in the transportation problem b. the number of origins must equal the number of destinations in the transportation problem c. each supply and demand value is 1 in the assignment problem d. there are many differences between the transportation and assignment problems 7. In the general linear programming model of the assignment problem, a. one agent can do parts of several tasks. b. one task can be done by several agents. c. each agent is assigned to its own best task. d. one agent is assigned to one and only one task. 8. The assignment problem is a special case of the a. transportation problem. b. transshipment problem. 1 2 Chapter 10 Distribution and Network Problems c. maximal flow problem. d. shortest-route problem. 9. Which of the following is not true regarding an LP model of the assignment problem? a. Costs appear in the objective function only. b. All constraints are of the > form. c. All constraint left-hand side coefficient values are 1. d. All decision variable values are either 0 or 1. 10. The assignment problem constraint x 31 + x 32 + x 33 + x 34 < 2 means a. agent 3 can be assigned to 2 tasks. b. agent 2 can be assigned to 3 tasks. c. a mixture of agents 1, 2, 3, and 4 will be assigned to tasks. d. there is no feasible solution....
View Full Document
- Spring '10