Question 1

Once a decision maker has determined the shortest route to any node in the network, that node becomes a member of the ________.

Accepted Answer

The answer of Once a decision maker has determined the...

Question 2

To determine the maximum possible flow of railroad cars through the rail system, they should first select the longest path from origin to destination and ship as much as possible on that path.

Accepted Answer

A) True 
 B)False

Question 3

Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram given in the figure below shows the possible routes and travel times (in minutes) from the carpet plant to the various warehouses or retail outlets.
   V = Valparaiso, P=Portage, G=Gary, Ha=Hammond, Hi=Highland, M = Merillville, L = Lansing
-Write the constraint associated with the Valparasio (source) node for the 0-1 integer linear programming formulation of the shortest route problem.

Accepted Answer

The answer of Pro-Carpet company manufactures carpets in Northwest Indiana...

Question 4

The maximal flow solution algorithm allows the user to choose a path through the network from the origin to the destination by any criteria.

Accepted Answer

A) True 
 B)False

Question 5

If we wanted to represent water resources as a network flow problem, which of the following would be represented as nodes?

Accepted Answer

A)  canals 
B)  pumping stations 
C)  rivers 
D)  pipelines 
A)  canals 
B)  pumping stations 
C)  rivers 
D)  pipelines

Question 6

Regardless of the number of nodes in a network, the minimal spanning tree never contains the two nodes with the greatest distance between them.

Accepted Answer

A) True 
 B)False

Question 7

Branches connect nodes and show flow from one point to another.

Accepted Answer

A) True 
 B)False

Question 8

-Which of these is the shortest route through the network?

Accepted Answer

A)  1-3-6 
B)  1-2-5-6 
C)  1-4-5-6 
D)  1-2-4-5-6 
A)  1-3-6 
B)  1-2-5-6 
C)  1-4-5-6 
D)  1-2-4-5-6

Question 9

In a network flow model, a directed branch

Accepted Answer

A)  is a branch with a positive distance value. 
B)  is a branch in which flow is possible in only one direction. 
C)  is a branch on which the flow capacity is exhausted. 
D)  is a branch in which flow is not possible in either direction. 
A)  is a branch with a positive distance value. 
B)  is a branch in which flow is possible in only one direction. 
C)  is a branch on which the flow capacity is exhausted. 
D)  is a branch in which flow is not possible in either direction.

Question 10

Draw the network associated with the following constraints for a shortest route problem.
X12 + X13 = 1
X12 - X24 = 0
X13 - X34 = 0
X24 + X34 - X45 = 0
X45 = 1

Accepted Answer

The answer of Draw the network associated with the following...

Question 11

Refer to the figure below to answer the following questions.
   Figure 3
-Consider the network diagram given in Figure 3 with the indicated flow capacities along each branch. What is the objective function for the 0-1 integer linear programming formulation of the maximal flow problem?

Accepted Answer

The answer of Refer to the figure below to answer...

Question 12

-If the origin node for this network is node number 1 and flow proceeds from node 1 to node 6, what is the shortest route through the network?

Accepted Answer

The answer of  
-If the origin node for this...

Question 13

Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram given in the figure below shows the possible routes and travel times (in minutes) from the carpet plant to the various warehouses or retail outlets.
   V = Valparaiso, P=Portage, G=Gary, Ha=Hammond, Hi=Highland, M = Merillville, L = Lansing
-Write the constraint associated with the Lansing (destination) node for the 0-1 integer linear programming formulation of the shortest route problem.

Accepted Answer

The answer of Pro-Carpet company manufactures carpets in Northwest Indiana...

Question 14

Figure 1. Delivery Routes
-Consider the network diagram given in Figure 1. Assume that the amount on each branch is the distance in miles between the respective nodes. Also assume that it is not possible to travel from a node with a higher number to a node with a lower number. Write the constraint associated with the second node (node 2) for the 0-1 integer linear programming formulation of the shortest route problem.

Accepted Answer

The answer of   Figure 1. Delivery Routes
-Consider the...

Question 15

Refer to the figure below to answer the following questions.
   Figure 3
-Consider the network diagram given in Figure 3 with the indicated flow capacities along each branch. What is the input-output constraint associated with the fifth node of the network diagram for the 0-1 integer linear programming formulation of the maximal flow problem?

Accepted Answer

X25 + X35

Question 16

The maximal flow algorithm may end with capacity remaining at the source.

Accepted Answer

A) True 
 B)False

Question 17

Pro-Carpet company manufactures carpets in Northwest Indiana and delivers them to warehouses and retail outlets. The network diagram given in figure below shows the possible routes and distances from the carpet plant in Valparaiso to the various warehouses or retail outlets.
   V = Valparaiso, P=Portage, G=Gary, Ha=Hammond, Hi=Highland, M = Merillville, L = Lansing
-What is the distance for the shortest route from the carpet plant in Valparaiso to retail outlet in Lansing, Illinois. State the total completion time in minutes.

Accepted Answer

A)  36 
B)  37 
C)  39 
D)  41 
A)  36 
B)  37 
C)  39 
D)  41

Question 18

Figure 4
-Determine the minimum distance required to connect all nodes in Figure 4.

Accepted Answer

A)  22 
B)  24 
C)  26 
D)  30 
A)  22 
B)  24 
C)  26 
D)  30

Question 19

Determining where capacity needs to be added within a series of one-way roads within a park represents a ________ model.

Accepted Answer

The answer of Determining where capacity needs to be added...

Question 20

In networks with fewer than five nodes, the minimal spanning tree algorithm will yield answers identical to the maximal flow solution approach.

Accepted Answer

A) True 
 B)False

Once a decision maker has determined the shortest route to any node in the network, that node becomes a member of the ________.

To determine the maximum possible flow of railroad cars through the rail system, they should first select the longest path from origin to destination and ship as much as possible on that path.

The maximal flow solution algorithm allows the user to choose a path through the network from the origin to the destination by any criteria.

If we wanted to represent water resources as a network flow problem, which of the following would be represented as nodes?

Regardless of the number of nodes in a network, the minimal spanning tree never contains the two nodes with the greatest distance between them.

Branches connect nodes and show flow from one point to another.

-Which of these is the shortest route through the network?

In a network flow model, a directed branch

Draw the network associated with the following constraints for a shortest route problem. X12 + X13 = 1 X12 - X24 = 0 X13 - X34 = 0 X24 + X34 - X45 = 0 X45 = 1

Refer to the figure below to answer the following questions. Figure 3 -Consider the network diagram given in Figure 3 with the indicated flow capacities along each branch. What is the objective function for the 0-1 integer linear programming formulation of the maximal flow problem?

-If the origin node for this network is node number 1 and flow proceeds from node 1 to node 6, what is the shortest route through the network?

The maximal flow algorithm may end with capacity remaining at the source.

Figure 4 -Determine the minimum distance required to connect all nodes in Figure 4.

Determining where capacity needs to be added within a series of one-way roads within a park represents a ________ model.

In networks with fewer than five nodes, the minimal spanning tree algorithm will yield answers identical to the maximal flow solution approach.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters

Exam 7: Network Flow Models

Once a decision maker has determined the shortest route to any node in the network, that node becomes a member of the ________.

To determine the maximum possible flow of railroad cars through the rail system, they should first select the longest path from origin to destination and ship as much as possible on that path.

The maximal flow solution algorithm allows the user to choose a path through the network from the origin to the destination by any criteria.

If we wanted to represent water resources as a network flow problem, which of the following would be represented as nodes?

Regardless of the number of nodes in a network, the minimal spanning tree never contains the two nodes with the greatest distance between them.

Branches connect nodes and show flow from one point to another.

-Which of these is the shortest route through the network?

In a network flow model, a directed branch

Draw the network associated with the following constraints for a shortest route problem. X12 + X13 = 1 X12 - X24 = 0 X13 - X34 = 0 X24 + X34 - X45 = 0 X45 = 1

Refer to the figure below to answer the following questions. Figure 3 -Consider the network diagram given in Figure 3 with the indicated flow capacities along each branch. What is the objective function for the 0-1 integer linear programming formulation of the maximal flow problem?

-If the origin node for this network is node number 1 and flow proceeds from node 1 to node 6, what is the shortest route through the network?

The maximal flow algorithm may end with capacity remaining at the source.

Figure 4 -Determine the minimum distance required to connect all nodes in Figure 4.

Determining where capacity needs to be added within a series of one-way roads within a park represents a ________ model.

In networks with fewer than five nodes, the minimal spanning tree algorithm will yield answers identical to the maximal flow solution approach.

Management Science

Linear Programming: Model Formulation and Graphical Solution

Linear Programming: Computer Solution and Sensitivity Analysis

Linear Programming: Modeling Examples

Integer Programming

Transportation, Transshipment, and Assignment Problems

Project Management

Multicriteria Decision Making

Nonlinear Programming

Probability and Statistics

Decision Analysis

Queuing Analysis

Simulation

Forecasting

Inventory Management

the Simplex Solution Method

Transportation and Assignment Solution Methods

Integer Programming: the Branch and Bound Method

Nonlinear Programming: Solution Techniques

Game Theory

Markov Analysis

Filters