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.
Consider the following maximal flow problem where node 1 is the source and node 6 is the destination.
3) Refer to the figure. What is the objective function?
A) Max X16
B) Min X16
C) Max X61
D) Min X61
E) Max X26 + X56
Answer: C
Page Ref: 209
Topic: Maximal Flow Problem
Difficulty: Easy
4) Refer to the figure. What is the constraint associated with node 6?
A) X46 + X56 = 0
B) X46 + X56 = 1
C) X46 + X56 - X61 = 1
D) X46 + X56 - X61 = -1
E) X46 + X56 - X61 = 0
Answer: E
Page Ref: 185
Topic: Maximal Flow Problem
Difficulty: Moderate
5) Refer to the figure. What is the maximum capacity associated with arc X61?
A) +1
B) -1
C) 0
D) +∞
E) -∞
Answer: D
Page Ref: 184
Topic: Maximal Flow Model
Difficulty: Moderate
6) Refer to the figure. What is the constraint associated with node 1?
A) -X12 - X13 = 1
B) X61 - X12 - X13 = -1
C) X61 - X12 - X13 = 1
D) X61 - X12 - X13 = 0
E) X61 - X12 - X13 = ∞
Answer: D
Page Ref: 184
Topic: Maximal Flow Model
Difficulty: Moderate
7) Refer to the figure. What is the constraint associated with node 2?
A) X12 - X24 = 0
B) X12 - X32 - X24 = 0
C) X12 + X32 - X24 = 1
D) X12 - X32 + X24 = 0
E) X12 + X32 - X24 = 0
Answer: E
Page Ref: 184
Topic: Maximal Flow Model
Difficulty: Moderate
8) Which