QMB 3602 Final Exam Questions
with All Correct Answers
Which of the following can be formulated as a linear programming problem
I. minimum cost flow problem
II. maximum flow problem
III. shortest path problem - Answer-I, II, and III
Shortest path problem formulation can be applied to which of the following?
I. finding the combination of travel modes which minimizes distance travelled
II. finding the combination of travel modes which minimizes travel time
III. finding the combination of travel modes which minimizes travel cost - Answer-I, II,
and III
a minimum cost flow problem has 8 supply nodes, 0 transshipment nodes, and 3
demand nodes, how many arcs will be included in the model - Answer-(8x3) = 24
A minimum cost flow problem has 5 supply nodes, 2 transshipment noes, and 5
demand nodes. each supply node can ship to each transshipment node but cannot ship
to any demand node or to any other supply node. each transshipment node can ship to
each demand node but cannot ship to any supply node or to any other transshipment
node. how many arcs will be included in the model - Answer-(5x2) + (2x5) = 20
A minimum cost flow problem may be summarized by drawing a network only after
writing out the full formulation - Answer-false
The model for any minimum cost flow problem is represented by a network with flow
passing through it - Answer-true
Network representations can be used for financial planning - Answer-true
Which of the following represents the marginal gain in the objective value that would
occur if one more unit of a resource were added? - Answer-shadow price
the process of determining the effect of changing objective function coefficients, right
hand side values of constraints, and decision variable values on a linear program is
known as - Answer-what-if analysis
with All Correct Answers
Which of the following can be formulated as a linear programming problem
I. minimum cost flow problem
II. maximum flow problem
III. shortest path problem - Answer-I, II, and III
Shortest path problem formulation can be applied to which of the following?
I. finding the combination of travel modes which minimizes distance travelled
II. finding the combination of travel modes which minimizes travel time
III. finding the combination of travel modes which minimizes travel cost - Answer-I, II,
and III
a minimum cost flow problem has 8 supply nodes, 0 transshipment nodes, and 3
demand nodes, how many arcs will be included in the model - Answer-(8x3) = 24
A minimum cost flow problem has 5 supply nodes, 2 transshipment noes, and 5
demand nodes. each supply node can ship to each transshipment node but cannot ship
to any demand node or to any other supply node. each transshipment node can ship to
each demand node but cannot ship to any supply node or to any other transshipment
node. how many arcs will be included in the model - Answer-(5x2) + (2x5) = 20
A minimum cost flow problem may be summarized by drawing a network only after
writing out the full formulation - Answer-false
The model for any minimum cost flow problem is represented by a network with flow
passing through it - Answer-true
Network representations can be used for financial planning - Answer-true
Which of the following represents the marginal gain in the objective value that would
occur if one more unit of a resource were added? - Answer-shadow price
the process of determining the effect of changing objective function coefficients, right
hand side values of constraints, and decision variable values on a linear program is
known as - Answer-what-if analysis
