Question 1

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 F) D) and E)
G) None of the above

Question 2

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

Accepted Answer

A) True 
 B)False

Question 3

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 F) A) and D)
G) C) and D)

Question 4

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 5

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 F) D) and E)
G) C) and D)

Question 6

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

Accepted Answer

A) True 
 B)False

Question 7

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

Accepted Answer

A) True 
 B)False

Question 8

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 9

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 10

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 11

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 12

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

Accepted Answer

A) True 
 B)False

Question 13

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 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 F) All of the above
G) D) and E)

Question 16

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 F) A) and D)
G) A) and B)

Question 17

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

Accepted Answer

A) True 
 B)False

Question 18

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 19

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 20

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 F) None of the above
G) D) and E)

Exam 6: Network optimization problems

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Network representations can be used for the following problems:

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

A minimum cost flow problem is a special type of:

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified