Question 1

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

Accepted Answer

A) True 
 B)False  False

Question 2

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 C

Question 3

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  True

Question 4

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 5

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

Accepted Answer

A) True 
 B)False

Question 6

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 7

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

Accepted Answer

A) True 
 B)False

Question 8

The amount of flow that is eventually sent through an arc is called the capacity of that arc

Accepted Answer

A) True 
 B)False

Question 9

Which of the following is an application of a shortest path problem?

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 10

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 11

Which of the following is not an assumption of a minimum cost flow problem?

Accepted Answer

A) At least one of the nodes is a supply node 
B) There is an equal number of supply and demand nodes 
C) Flow through an arc is only allowed in the direction indicated by the arrowhead 
D) The cost of the flow through each arc is proportional to the amount of that flow 
E) The objective is either to minimize the total cost or to maximize the total profit 
A) At least one of the nodes is a supply node 
B) There is an equal number of supply and demand nodes 
C) Flow through an arc is only allowed in the direction indicated by the arrowhead 
D) The cost of the flow through each arc is proportional to the amount of that flow 
E) The objective is either to minimize the total cost or to maximize the total profit

Question 12

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 13

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

Accepted Answer

A) True 
 B)False

Question 14

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 15

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 16

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 17

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 18

Network representations can be used for financial planning

Accepted Answer

A) True 
 B)False

Question 19

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 20

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

Accepted Answer

A) True 
 B)False

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

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

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

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

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

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 maximum flow problem,the source and sink have fixed supplies and demands

The amount of flow that is eventually sent through an arc is called the capacity of that arc

Which of the following is an application of a shortest path problem?

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

Which of the following is not an assumption of a minimum cost flow problem?

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

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

What is the objective of a maximum 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:

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

Network representations can be used for financial planning

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

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters

Exam 6: Network optimization problems

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

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

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

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

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

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 maximum flow problem,the source and sink have fixed supplies and demands

The amount of flow that is eventually sent through an arc is called the capacity of that arc

Which of the following is an application of a shortest path problem?

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

Which of the following is not an assumption of a minimum cost flow problem?

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

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

What is the objective of a maximum 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:

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

Network representations can be used for financial planning

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

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

Introduction

Linear programming: Basic Concepts

Linear programming: Formulation and applications

Theart of modeling with spread sheets

What-If Analysis for linear programming

Using binary integer programming to deal withy es-Or-No decisions

Non linear programming

Decision Analysis

Forecasting

Queuing models

Computer simulation: Basic Concepts

Computer simulation with risks olver platform

Solution concepts for linear programming

Transportation and assignment problems

Pert CPM models for project management

Goal programming

Inventory management with known demand

Inventory management with uncertain demand

Computer simulation with crystal ball

Filters