# Brs Mdm3 Tif Ch05 Essay

1883 Words8 Pages
Managerial Decision Modeling w/ Spreadsheets, 3e (Balakrishnan/Render/Stair) Chapter 5 Transportation, Assignment, and Network Models 5.1 Chapter Questions 1) Which of the following is NOT a network flow model? A) Transportation model B) Assignment model C) Product mix model D) Shortest-path model E) Minimal-spanning tree model Answer: C Page Ref: 162 Topic: Introduction Difficulty: Easy 2) Which of the following models determines the path through the network that connects all the points? A) Transportation model B) Assignment model C) Product mix model D) Shortest-path model E) Minimal-spanning tree model Answer: E Page Ref: 163 Topic: Introduction Difficulty: Easy Use the information below to answer the following questions.…show more content…
Machine 1 2 3 A \$3 \$4 \$2 Job B \$1 \$3 \$5 C \$6 \$4 \$2 Let Xij = 1 if job i is assigned to machine j, otherwise 0. A) XA2 + XB2 + XC2 = +1 B) XA2 + XB2 + XC2 = 0 C) XA2 + XB2 + XC2 = -1 D) 4XA2 + 3XB2 + 4XC2 = +1 E) 4XA2 + 3XB2 + 4XC2 = -1 Answer: A Page Ref: 180 Topic: Assignment Model Difficulty: Moderate 14) Consider the following transshipment problem. The shipping cost per unit between nodes 1 and 2 is \$10, while the shipping cost per unit between nodes 2 and 3 is \$12. What is the objective function? A) Min X12 + X23 B) Max X12 + X23 C) Min 10X12 + 12X13 D) Min -10X12 - 12X13 E) Max 10X12 + 12X23 Answer: C Page Ref: 175 Topic: Transshipment Model Difficulty: Easy 15) In an unbalanced transportation problem where total supply exceeds total demand, the supply constraints will typically have "≥" inequalities. Answer: FALSE Page Ref: 170 Topic: Transportation Model Difficulty: Moderate 16) In an unbalanced transportation problem where total demand exceeds total supply, the demand constraints will typically have "≤" inequalities. Answer: TRUE Page Ref: 170 Topic: Transportation Model Difficulty: Moderate 17) All supply and demand quantities in an assignment model equal one unit. Answer: TRUE Page Ref: 181 Topic: Assignment Model Difficulty: Easy 18) In a maximal flow problem, each node in the network is associated with a decision variable. Answer: FALSE Page Ref: 184 Topic: Maximal Flow Model Difficulty: Easy 19) In a maximal flow