# Essay about Brs Mdm3 Tif Ch05

Words: 1878
Pages: 8

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
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
Page Ref: 163
Topic: Introduction
Difficulty: Easy
Use the information below to answer the following questions.
Page Ref: 184
Topic: Maximal Flow Model
Difficulty: Easy

20) In a maximal flow problem, the right-hand side of the flow balance constraints equals 1.
Page Ref: 185
Topic: Maximal Flow Model
Difficulty: Moderate

21) The starting node of the shortest path problem has a supply value of -1.
Page Ref: 188
Topic: Shortest-Path Model
Difficulty: Easy

22) The objective function of an assignment problem may be either maximization or minimization.
Page Ref: 180
Topic: Assignment Model
Difficulty: Moderate
23) In a maximal flow problem, all the net flows are typically zeros.
Page Ref: 185
Topic: Maximal Flow Model
Difficulty: Moderate

24) Every node in a network flow problem has a decision variable associated with it.
Page Ref: 164
Topic: Characteristics of Network Models
Difficulty: Moderate

25) In a maximal flow problem, the flow capacity on the dummy arc connecting the destination node to the source node should be set to a very large value.