Question 1

Conservation of flow is achieved when the flow through a node is minimized.

Accepted Answer

A) True 
 B)False

Question 2

In a minimum cost flow problem,the cost of the flow through each arc is proportional to the amount of that flow.

Accepted Answer

A) True 
 B)False

Question 3

The objective of a minimum cost flow problem is to minimize the total cost of sending the available supply through the network even if all demand is not satisfied.

Accepted Answer

A) True 
 B)False

Question 4

When reformulating a shortest path problem as a minimum cost flow problem,each link should be replaced by a pair of arcs pointing in opposite directions.
Multiple Choice Questions

Accepted Answer

A) True 
 B)False

Question 5

In a shortest path problem there are no arcs permitted,only links.

Accepted Answer

A) True 
 B)False

Question 6

As long as all its supplies and demands have integer values,any minimum cost flow problem is guaranteed to have an optimal solution with integer values.

Accepted Answer

A) True 
 B)False

Question 7

All network optimization problems actually are special types of linear programming problems.

Accepted Answer

A) True 
 B)False

Question 8

The objective of a maximum flow problem is to maximize the total profit generated by sending flow through a network.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following problems are special types of minimum cost flow problems?
I.Transportation problems.
II.Assignment problems.
III.Transshipment problems.
IV.Shortest path problems.

Accepted Answer

A) I and II only. 
B) I,II,and III only. 
C) IV only. 
D) I,II,III,and IV. 
E) None of the above. 
A) I and II only. 
B) I,II,and III only. 
C) IV only. 
D) I,II,III,and IV. 
E) None of the above.

Question 10

A minimum cost flow problem is a special type of:

Accepted Answer

A) linear programming problem. 
B) transportation problem. 
C) spanning tree problem. 
D) transshipment problem. 
E) maximum flow problem. 
A) linear programming problem. 
B) transportation problem. 
C) spanning tree problem. 
D) transshipment problem. 
E) maximum flow problem.

Question 11

Network representations can be used for financial planning.

Accepted Answer

A) True 
 B)False

Question 12

Which of the following will have negative net flow in a minimum cost flow problem?

Accepted Answer

A) Supply nodes. 
B) Transshipment nodes. 
C) Demand nodes. 
D) Arc capacities. 
E) None of the above. 
A) Supply nodes. 
B) Transshipment nodes. 
C) Demand nodes. 
D) Arc capacities. 
E) None of the above.

Question 13

Minimum cost flow problems are the special type of linear programming problem referred to as distribution-network problems.

Accepted Answer

A) True 
 B)False

Question 14

Which of the following is an application of a shortest path problem?
I.Minimize total distance traveled.
II.Minimize total flow through a network.
III.Minimize total cost of a sequence of activities.
IV.Minimize total time of a sequence of activities

Accepted Answer

A) I and II only 
B) I,II,and III only. 
C) IV only 
D) I,II,III,and IV 
E) I,III,and IV only. 
A) I and II only 
B) I,II,and III only. 
C) IV only 
D) I,II,III,and IV 
E) I,III,and IV only.

Question 15

The source and sink of a maximum flow problem are analogous to the supply nodes and demand nodes of a minimum cost flow problem.

Accepted Answer

A) True 
 B)False

Question 16

In a feasible minimum cost flow problem,the network has enough arcs with sufficient capacity to enable all the flow generated at the supply nodes to reach all the demand nodes.

Accepted Answer

A) True 
 B)False

Question 17

In a shortest path problem,when "real travel" through a network can end at more than one node:

Accepted Answer

A) an arc with length 0 is inserted. 
B) the problem cannot be solved. 
C) a dummy destination is needed. 
D) c only. 
E) a and c only. 
A) an arc with length 0 is inserted. 
B) the problem cannot be solved. 
C) a dummy destination is needed. 
D) c only. 
E) a and c only.

Question 18

For a minimum cost flow problem to have a feasible solution,which of the following must be true?

Accepted Answer

A) There is the same number of supply nodes and demand nodes. 
B) There is only one supply node and one demand node. 
C) There is an equal amount of supply and demand. 
D) The supply and demand must be integers. 
E) The transshipment nodes must be able to absorb flow. 
A) There is the same number of supply nodes and demand nodes. 
B) There is only one supply node and one demand node. 
C) There is an equal amount of supply and demand. 
D) The supply and demand must be integers. 
E) The transshipment nodes must be able to absorb flow.

Question 19

A minimum cost flow problem may be summarized by drawing a network only after writing out the full formulation.

Accepted Answer

A) True 
 B)False

Question 20

In a true maximum flow problem there is only one source and one sink.

Accepted Answer

A) True 
 B)False

Exam 6: Network Optimization Problems

Conservation of flow is achieved when the flow through a node is minimized.

In a minimum cost flow problem,the cost of the flow through each arc is proportional to the amount of that flow.

The objective of a minimum cost flow problem is to minimize the total cost of sending the available supply through the network even if all demand is not satisfied.

When reformulating a shortest path problem as a minimum cost flow problem,each link should be replaced by a pair of arcs pointing in opposite directions. Multiple Choice Questions

In a shortest path problem there are no arcs permitted,only links.

As long as all its supplies and demands have integer values,any minimum cost flow problem is guaranteed to have an optimal solution with integer values.

All network optimization problems actually are special types of linear programming problems.

The objective of a maximum flow problem is to maximize the total profit generated by sending flow through a network.

Which of the following problems are special types of minimum cost flow problems? I.Transportation problems. II.Assignment problems. III.Transshipment problems. IV.Shortest path problems.

A minimum cost flow problem is a special type of:

Network representations can be used for financial planning.

Which of the following will have negative net flow in a minimum cost flow problem?

Minimum cost flow problems are the special type of linear programming problem referred to as distribution-network problems.

Which of the following is an application of a shortest path problem? I.Minimize total distance traveled. II.Minimize total flow through a network. III.Minimize total cost of a sequence of activities. IV.Minimize total time of a sequence of activities

The source and sink of a maximum flow problem are analogous to the supply nodes and demand nodes of a minimum cost flow problem.

In a feasible minimum cost flow problem,the network has enough arcs with sufficient capacity to enable all the flow generated at the supply nodes to reach all the demand nodes.

In a shortest path problem,when "real travel" through a network can end at more than one node:

For a minimum cost flow problem to have a feasible solution,which of the following must be true?

A minimum cost flow problem may be summarized by drawing a network only after writing out the full formulation.

In a true maximum flow problem there is only one source and one sink.

Introduction

Linear Programming: Basic Concepts

Linear Programming: Formulation and Applications

The Art of Modeling With Spreadsheets

What-If Analysis for Linear Programming

Using Binary Integer Programming to Deal With Yes-Or-No Decisions

Nonlinear Programming

Decision Analysis

Cd Supplement - Decision Analysis

Forecasting

Queueing Models

CD Supplement - Additional Queueing Models

Computer Simulation: Basic Concepts

CD Supplement - the Inverse Transformation Method for Generating Random Observations

Computer Simulation With Crystal Ball

CD - Solution Concepts for Linear Programming

CD - Transportation and Assignment Problems

CD - Pertcpm Models for Project Management

CD - Goal Programming

CD - Inventory Management With Known Demand

CD - Inventory Management With Uncertain Demand

Filters