Question 1

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 2

Maximum flow problems are concerned with maximizing the flow of goods through a distribution network.

Accepted Answer

A) True 
 B)False

Question 3

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 4

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 5

Each node in a minimum cost flow problem where the net amount of flow generated is a fixed positive number is a demand node.

Accepted Answer

A) True 
 B)False

Question 6

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 7

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

Accepted Answer

A) True 
 B)False

Question 8

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.

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

Maximum flow problems are concerned with maximizing the flow of goods through a distribution network.

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

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.

Each node in a minimum cost flow problem where the net amount of flow generated is a fixed positive number is a demand node.

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

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

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

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

Exam 6: Network Optimization Problems

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

Maximum flow problems are concerned with maximizing the flow of goods through a distribution network.

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

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.

Each node in a minimum cost flow problem where the net amount of flow generated is a fixed positive number is a demand node.

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

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

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

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