Question 1

The network simplex method can aid managers in conducting what-if analysis.

Accepted Answer

A) True 
 B)False  True

Question 2

Which of the following is an example of a transshipment node?

Accepted Answer

A) Storage facilities. 
B) Processing facilities. 
C) Short-term investment options. 
D) Warehouses. 
E) All of the above. 
A) Storage facilities. 
B) Processing facilities. 
C) Short-term investment options. 
D) Warehouses. 
E) All of the above. E

Question 3

In a shortest path problem,the lines connecting the nodes are referred to as arcs.

Accepted Answer

A) True 
 B)False  False

Question 4

In a minimum cost flow problem there can be only one supply node and only one demand node.

Accepted Answer

A) True 
 B)False

Question 5

Network representations can be used for the following problems:

Accepted Answer

A) project planning. 
B) facilities location. 
C) financial planning. 
D) resource management. 
E) all of the above. 
A) project planning. 
B) facilities location. 
C) financial planning. 
D) resource management. 
E) all of the above.

Question 6

A network representation is a very specific conceptual aid and is only used in special cases.

Accepted Answer

A) True 
 B)False

Question 7

The source and sink of a maximum flow problem have conservation of flow.

Accepted Answer

A) True 
 B)False

Question 8

Which of the following can be used to optimally solve minimum cost flow problems?

Accepted Answer

A) The simplex method. 
B) The network simplex method. 
C) A greedy algorithm. 
D) a and b only. 
E) All of the above. 
A) The simplex method. 
B) The network simplex method. 
C) A greedy algorithm. 
D) a and b only. 
E) All of the above.

Question 9

In a maximum flow problem,the source and sink have fixed supplies and demands.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following is not an assumption of a shortest path problem?

Accepted Answer

A) The lines connecting certain pairs of nodes always allow travel in either direction. 
B) Associated with each link or arc is a nonnegative number called its length. 
C) A path through the network must be chosen going from the origin to the destination. 
D) The objective is to find a shortest path from the origin to the destination. 
E) None of the above. 
A) The lines connecting certain pairs of nodes always allow travel in either direction. 
B) Associated with each link or arc is a nonnegative number called its length. 
C) A path through the network must be chosen going from the origin to the destination. 
D) The objective is to find a shortest path from the origin to the destination. 
E) None of the above.

Question 11

Any minimum cost flow problem where each arc can carry any desired amount of flow is a transshipment problem.

Accepted Answer

A) True 
 B)False

Question 12

What is the objective of a maximum flow problem?

Accepted Answer

A) Maximize the amount flowing through a network. 
B) Maximize the profit of the network. 
C) Maximize the routes being used. 
D) Maximize the amount produced at the origin. 
E) None of the above. 
A) Maximize the amount flowing through a network. 
B) Maximize the profit of the network. 
C) Maximize the routes being used. 
D) Maximize the amount produced at the origin. 
E) None of the above.

Question 13

Any node where the net amount of flow generated is fixed at zero is a transshipment node.

Accepted Answer

A) True 
 B)False

Question 14

The model for any minimum cost flow problem is represented by a network with flow passing through it.

Accepted Answer

A) True 
 B)False

Question 15

Shortest path problems are concerned with finding the shortest route through a network

Accepted Answer

A) True 
 B)False

Question 16

A maximum flow problem can be fit into the format of a minimum cost flow problem.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following could be the subject of a maximum flow problem?

Accepted Answer

A) Products. 
B) Oil. 
C) Vehicles. 
D) All of the above. 
E) None of the above. 
A) Products. 
B) Oil. 
C) Vehicles. 
D) All of the above. 
E) None of the above.

Question 18

The network simplex method can be used to solve minimum cost flow problems with over a million arcs.

Accepted Answer

A) True 
 B)False

Question 19

In a maximum flow problem,flow is permitted in both directions and is represented by a pair of arcs pointing in opposite directions.

Accepted Answer

A) True 
 B)False

Question 20

A transportation problem is just a minimum cost flow problem without any transshipment nodes and without any capacity constraints on the arcs.

Accepted Answer

A) True 
 B)False

Exam 6: Network Optimization Problems

The network simplex method can aid managers in conducting what-if analysis.

Which of the following is an example of a transshipment node?

In a shortest path problem,the lines connecting the nodes are referred to as arcs.

In a minimum cost flow problem there can be only one supply node and only one demand node.

Network representations can be used for the following problems:

A network representation is a very specific conceptual aid and is only used in special cases.

The source and sink of a maximum flow problem have conservation of flow.

Which of the following can be used to optimally solve minimum cost flow problems?

In a maximum flow problem,the source and sink have fixed supplies and demands.

Which of the following is not an assumption of a shortest path problem?

Any minimum cost flow problem where each arc can carry any desired amount of flow is a transshipment problem.

What is the objective of a maximum flow problem?

Any node where the net amount of flow generated is fixed at zero is a transshipment node.

The model for any minimum cost flow problem is represented by a network with flow passing through it.

Shortest path problems are concerned with finding the shortest route through a network

A maximum flow problem can be fit into the format of a minimum cost flow problem.

Which of the following could be the subject of a maximum flow problem?

The network simplex method can be used to solve minimum cost flow problems with over a million arcs.

In a maximum flow problem,flow is permitted in both directions and is represented by a pair of arcs pointing in opposite directions.

A transportation problem is just a minimum cost flow problem without any transshipment nodes and without any capacity constraints on the arcs.

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