Download Distribution and Network Models: True/False and Multiple Choice Questions and more Exams Mathematical Analysis in PDF only on Docsity!
True / False
- Whenever total supply is less than total demand in a transportation problem, the LP model does not determine how the unsatisfied demand is handled. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- Converting a transportation problem LP from cost minimization to profit maximization requires only changing the objective function; the conversion does not affect the constraints. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- A transportation problem with three sources and four destinations will have seven decision variables. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6.
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- If a transportation problem has four origins and five destinations, the LP formulation of the problem will have nine constraints. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- When a transportation problem has capacity limitations on one or more of its routes, it is known as a capacitated transportation problem. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- When the number of agents exceeds the number of tasks in an assignment problem, one or more dummy tasks must be introduced in the LP formulation or else the LP will not have a feasible solution. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- A dummy origin in a transportation problem is used when supply exceeds demand. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- When a route in a transportation problem is unacceptable, the corresponding variable can be removed from the LP formulation. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- In the LP formulation of a maximal flow problem, a conservation of flow constraint ensures that an arc's flow capacity is not exceeded. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.04 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 6.4 Maximal Flow Problem KEYWORDS: Bloom's: Understand
- The maximal flow problem can be formulated as a capacitated transshipment problem and determines the maximum amount of flow (such as messages, vehicles, fluid, etc.) that can enter and exit a network system in a given period of time. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.04 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.4 Maximal Flow Problem KEYWORDS: Bloom's: Understand
- The direction of flow in the shortest-route problem is always out of the origin node and into the destination node. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.03 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.3 Shortest-Route Problem KEYWORDS: Bloom's: Remember
- A transshipment problem is a generalization of the transportation problem in which certain nodes are neither supply nodes nor destination nodes. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6.
TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- In a transportation problem with total supply equal to total demand, if there are four origins and seven destinations, and there is a unique optimal solution, the optimal solution will utilize 11 shipping routes. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- In an assignment problem, one agent can be assigned to several tasks. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.02 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.2 Assignment Problem KEYWORDS: Bloom's: Remember
- In a capacitated transshipment problem, some or all of the transfer points are subject to capacity restrictions. a. True b. False ANSWER: False POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking
TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- In a transportation problem, excess supply will appear as slack in the linear programming solution. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- There are two specific types of problems common in supply chain models that can be solved using linear programing: transportation problems and transshipment problems. a. True b. False ANSWER: True POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember Multiple Choice
- The problem that deals with the distribution of goods from several sources to several destinations is a(n) a. maximal flow problem. b. transportation problem. c. assignment problem. d. shortest-route problem.
KEYWORDS: Bloom's: Understand
- We represent the number of units shipped from origin i to destination j by a. xij. b. xji. c. oij. d. oji. ANSWER: a POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- 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 calculated as number of origins times number of destinations. c. The number of constraints is calculated as number of origins times number of destinations. d. The constraints' left-hand-side coefficients are either 0 or 1. ANSWER: c POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- 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. ANSWER: c POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.02 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.2 Assignment Problem KEYWORDS: Bloom's: Understand
- 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. ANSWER: d POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.02 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.2 Assignment Problem KEYWORDS: Bloom's: Understand
- The assignment problem is a special case of the a. transportation problem. b. transshipment problem. c. maximal flow problem. d. shortest-route problem. ANSWER: a POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.02 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.2 Assignment Problem KEYWORDS: Bloom's: Remember
NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Remember
- Constraints in a transshipment problem a. correspond to arcs. b. include a variable for every arc. c. require the sum of the shipments out of an origin node to equal supply. d. All of these are correct. ANSWER: b POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- In a transshipment problem, shipments a. cannot occur between two origin nodes. b. cannot occur between an origin node and a destination node. c. cannot occur between a transshipment node and a destination node. d. can occur between any two nodes. ANSWER: d POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Understand
- Consider a shortest-route problem in which a bank courier must travel between branches and the main operations center. When represented with a network, a. the branches are the arcs and the operations center is the node. b. the branches are the nodes and the operations center is the source. c. the branches and the operations center are all nodes and the streets are the arcs.
d. the branches are the network and the operations center is the node. ANSWER: c POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.03 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.3 Shortest-Route Problem KEYWORDS: Bloom's: Understand
- The shortest-route problem finds the shortest route a. from the source to any other node. b. from any node to any other node. c. from any node to the destination. d. None of these are correct. ANSWER: b POINTS: 1 DIFFICULTY: Easy LEARNING OBJECTIVES: IMS.ASWC.19.06.03 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.3 Shortest-Route Problem KEYWORDS: Bloom's: Remember
- Consider a maximal flow problem in which vehicle traffic entering a city is routed among several routes before eventually leaving the city. When represented with a network, a. the nodes represent stoplights. b. the arcs represent one-way streets. c. the nodes represent locations where speed limits change. d. None of these are correct. ANSWER: b POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.04 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.4 Maximal Flow Problem KEYWORDS: Bloom's: Understand
POINTS: 1
DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.02 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.2 Assignment Problem KEYWORDS: Bloom's: Understand
- The network flows into and out of demand nodes are what makes the production and inventory application modeled in the textbook a a. shortest-route model. b. maximal flow model. c. transportation model. d. transshipment model. ANSWER: d POINTS: 1 DIFFICULTY: Moderate LEARNING OBJECTIVES: IMS.ASWC.19.06.05 - 6. NATIONAL STANDARDS: United States - BUSPROG: Reflective Thinking TOPICS: 6.5 A Production and Inventory Application KEYWORDS: Bloom's: Understand Subjective Short Answer
- Write the LP formulation for this transportation problem. ANSWER:
Min
5X1A + 6X1B + 4X2A + 2X2B + 3X3A + 6X3B + 9X 4A +
7X4B
s.t. X1A + X1B ≤ 100 X2A + X2B ≤ 200 X3A + X3B ≤ 150 X4A + X4B ≤ 50 X1A + X2A + X3A + X4A = 250 X1B + X 2B + X3B + X4B = 250 all Xij ≥ 0 POINTS: 1 DIFFICULTY: Challenging LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Analytic TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Create
- Draw the network for this transportation problem. Min 2XAX + 3XAY + 5XAZ+ 9XBX + 12XBY + 10XBZ s.t. XAX + XAY + XAZ ≤ 500 X (^) BX + XBY + XBZ ≤ 400 XAX + XBX = 300 XAY + XBY = 300 XAZ + XBZ = 300 Xij ≥ 0 ANSWER: POINTS: 1
s.t. XAX + XAY + XAZ ≤ 200 XBX + XBY ≤ 100 XCX + XCY + XCZ ≤ 150 XDX + XDY + XDZ ≤ 50 XAX + XBX + XCX + XDX = 250 X (^) AY + XBY + XCY + XDY = 125 XAZ + XBZ + XCZ + XDZ = 125 Xij ≥ 0 POINTS: 1 DIFFICULTY: Challenging LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Analytic TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Create
- After some special presentations, the employees of AV Center have to move projectors back to classrooms. The table below indicates the buildings where the projectors are now (the sources), where they need to go (the destinations), and a measure of the distance between sites. Destination Source Business Education Parsons Hall Holmstedt Hall Supply Baker Hall 10 9 5 2 35 Tirey Hall 12 11 1 6 10 Arena 15 14 7 6 20 Demand 12 20 10 10 a. If you were going to write this as a linear programming model, how many decision variables would there be, and how many constraints would there be? The solution to this problem is shown below. Use it to answer questions b through e. TRANSPORTATION PROBLEM
OPTIMAL TRANSPORTATION SCHEDULE
FROM TO DESTINATION FROM 1 2 3 4
ORIGIN
TOTAL TRANSPORTATION COST OR REVENUE IS 358
NOTE: THE TOTAL SUPPLY EXCEEDS THE TOTAL DEMAND BY 13
ORIGIN EXCESS SUPPLY
b. How many projectors are moved from Baker to Business? c. How many projectors are moved from Tirey to Parsons? d. How many projectors are moved from Arena to Education? e. Which site(s) has (have) projectors left? ANSWER: a. 12 decision variables, 7 constraints b. 12 c. 10 d. 0 e. Arena POINTS: 1 DIFFICULTY: Challenging LEARNING OBJECTIVES: IMS.ASWC.19.06.01 - 6. NATIONAL STANDARDS: United States - BUSPROG: Analytic TOPICS: 6.1 Supply Chain Models KEYWORDS: Bloom's: Evaluate
- Show both the network and the linear programming formulation for this assignment problem. Task Person A B C D 1 9 5 4 2 2 12 6 3 5 3 11 6 5 7
