Question 1

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 2

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 3

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

Accepted Answer

A) All flow through the network originates at one node,called the source 
B) If a node is not the source or the sink then it is a transshipment node 
C) Flow can move toward the sink and away from the sink 
D) The maximum amount of flow through an arc is given by the capacity of the arc 
E) The objective is to maximize the total amount of flow from the source to the sink 
A) All flow through the network originates at one node,called the source 
B) If a node is not the source or the sink then it is a transshipment node 
C) Flow can move toward the sink and away from the sink 
D) The maximum amount of flow through an arc is given by the capacity of the arc 
E) The objective is to maximize the total amount of flow from the source to the sink

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

Which of the following problems are special types of minimum cost flow 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 6

A shortest path problem is required to have only a single destination

Accepted Answer

A) True 
 B)False

Question 7

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 8

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

Accepted Answer

A) True 
 B)False

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

A network model showing the geographical layout of the problem is the usual way to represent a shortest path problem

Accepted Answer

A) True 
 B)False

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

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 13

A minimum cost flow problem will have feasible solutions as long as there is a balance between the total supply from the supply nodes and the total demand at the demand nodes

Accepted Answer

A) True 
 B)False

Question 14

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

Accepted Answer

A) True 
 B)False

Question 15

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

Question 16

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 17

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

Accepted Answer

A) True 
 B)False

Question 18

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 19

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 20

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

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

A minimum cost flow problem is a special type of:

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

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

Which of the following problems are special types of minimum cost flow problems?

A shortest path problem is required to have only a single destination

Network representations can be used for the following problems:

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

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

A network model showing the geographical layout of the problem is the usual way to represent a shortest path problem

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

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

A minimum cost flow problem will have feasible solutions as long as there is a balance between the total supply from the supply nodes and the total demand at the demand nodes

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

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

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

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

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

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

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

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

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

A minimum cost flow problem is a special type of:

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

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

Which of the following problems are special types of minimum cost flow problems?

A shortest path problem is required to have only a single destination

Network representations can be used for the following problems:

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

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

A network model showing the geographical layout of the problem is the usual way to represent a shortest path problem

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

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

A minimum cost flow problem will have feasible solutions as long as there is a balance between the total supply from the supply nodes and the total demand at the demand nodes

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

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

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

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

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

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

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

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