Question 1

Find the least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses).

Accepted Answer

A)  250 
B)  400 
C)  350 
D)  300 
E)  None of the above 
A)  250 
B)  400 
C)  350 
D)  300 
E)  None of the above

Question 2

Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from Town 1 to Town 7?

Accepted Answer

A)  max flow = 4 units 
B)  max flow = 6 units 
C)  max flow = 3 units 
D)  max flow = 9 units 
E)  None of the above 
A)  max flow = 4 units 
B)  max flow = 6 units 
C)  max flow = 3 units 
D)  max flow = 9 units 
E)  None of the above

Question 3

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Accepted Answer

A)  900 
B)  650 
C)  400 
D)  1200 
E)  None of the above 
A)  900 
B)  650 
C)  400 
D)  1200 
E)  None of the above

Question 4

Briefly describe the minimal shortest-route technique.

Accepted Answer

determines

Question 5

Find the shortest route from Node 1 to Node 6.

Accepted Answer

A)  300 
B)  450 
C)  550 
D)  650 
E)  None of the above 
A)  300 
B)  450 
C)  550 
D)  650 
E)  None of the above

Question 6

The first step in the maximal-flow technique is to

Accepted Answer

A)  pick the node with the maximum flow. 
B)  pick any path with some flow. 
C)  eliminate any node that has a zero flow. 
D)  add a dummy flow from the start to the finish. 
E)  None of the above 
A)  pick the node with the maximum flow. 
B)  pick any path with some flow. 
C)  eliminate any node that has a zero flow. 
D)  add a dummy flow from the start to the finish. 
E)  None of the above

Question 7

Given a network with the following distances:   (a) Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6.
(b) Determine the minimum distance.

Accepted Answer

(a) Connec

Question 8

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Accepted Answer

A)  290 
B)  310 
C)  620 
D)  460 
E)  None of the above 
A)  290 
B)  310 
C)  620 
D)  460 
E)  None of the above

Question 9

Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes.

Accepted Answer

A)  200 
B)  300 
C)  400 
D)  500 
E)  None of the above 
A)  200 
B)  300 
C)  400 
D)  500 
E)  None of the above

Question 10

In network models, the lines connecting the nodes are called ________.

Accepted Answer

A)  bridges 
B)  arrows 
C)  spans 
D)  arcs 
E)  links 
A)  bridges 
B)  arrows 
C)  spans 
D)  arcs 
E)  links

Question 11

When using the shortest-route technique, the second step is to

Accepted Answer

A)  find the next-nearest node to the origin and put the distance in a box by the node. 
B)  trace the path from the warehouse to the plant. 
C)  determine the average distance traveled from source to end. 
D)  find the nearest node to the origin and put a distance box by the node. 
E)  None of the above 
A)  find the next-nearest node to the origin and put the distance in a box by the node. 
B)  trace the path from the warehouse to the plant. 
C)  determine the average distance traveled from source to end. 
D)  find the nearest node to the origin and put a distance box by the node. 
E)  None of the above

Question 12

Lines connecting nodes on a network are called links.

Accepted Answer

A) True 
 B)False

Question 13

Find the shortest route from Node 1 to Node 6.

Accepted Answer

A)  total distance = 350 
B)  total distance = 410 
C)  total distance = 270 
D)  total distance = 520 
E)  None of the above 
A)  total distance = 350 
B)  total distance = 410 
C)  total distance = 270 
D)  total distance = 520 
E)  None of the above

Question 14

The maximal-flow model assumes that there is a net flow from "source" to "sink."

Accepted Answer

A) True 
 B)False

Question 15

Find the shortest route from Node 1 to Node 4.

Accepted Answer

A)  750 
B)  500 
C)  550 
D)  600 
E)  50 
A)  750 
B)  500 
C)  550 
D)  600 
E)  50

Question 16

The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following problems can be solved using linear programming?

Accepted Answer

A)  maximal-flow problem 
B)  shortest-route problem 
C)  minimal-spanning tree problem 
D)  A and B 
E)  A, B, and C 
A)  maximal-flow problem 
B)  shortest-route problem 
C)  minimal-spanning tree problem 
D)  A and B 
E)  A, B, and C

Question 18

Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.

Accepted Answer

A)  100 
B)  150 
C)  200 
D)  50 
E)  None of the above 
A)  100 
B)  150 
C)  200 
D)  50 
E)  None of the above

Question 19

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Accepted Answer

A)  1000 
B)  800 
C)  700 
D)  1100 
E)  None of the above 
A)  1000 
B)  800 
C)  700 
D)  1100 
E)  None of the above

Question 20

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called

Accepted Answer

A)  maximal-flow. 
B)  maximal-spanning. 
C)  shortest-route. 
D)  maximal-tree. 
A)  maximal-flow. 
B)  maximal-spanning. 
C)  shortest-route. 
D)  maximal-tree.

Find the least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses).

Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from Town 1 to Town 7?

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Briefly describe the minimal shortest-route technique.

Find the shortest route from Node 1 to Node 6.

The first step in the maximal-flow technique is to

Given a network with the following distances: (a) Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6. (b) Determine the minimum distance.

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes.

In network models, the lines connecting the nodes are called ________.

When using the shortest-route technique, the second step is to

Lines connecting nodes on a network are called links.

Find the shortest route from Node 1 to Node 6.

The maximal-flow model assumes that there is a net flow from "source" to "sink."

Find the shortest route from Node 1 to Node 4.

The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods.

Which of the following problems can be solved using linear programming?

Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters

Exam 11: Network Models

Find the least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses).

Given the following traffic flows, in hundreds of cars per hour, what is the maximum traffic flow from Town 1 to Town 7?

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Briefly describe the minimal shortest-route technique.

Find the shortest route from Node 1 to Node 6.

The first step in the maximal-flow technique is to

Given a network with the following distances: (a) Determine which nodes should be connected to get the minimum distance from Nodes 1 through 6. (b) Determine the minimum distance.

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

Given the following nodes and distances, determine the minimum length of cable necessary to connect all six nodes.

In network models, the lines connecting the nodes are called ________.

When using the shortest-route technique, the second step is to

Lines connecting nodes on a network are called links.

Find the shortest route from Node 1 to Node 6.

The maximal-flow model assumes that there is a net flow from "source" to "sink."

Find the shortest route from Node 1 to Node 4.

The maximal-flow technique might be used by the U.S. Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods.

Which of the following problems can be solved using linear programming?

Pipeline fluid flows are indicated below. Determine the maximum flow from Node 1 to Node 4.

Given the following distances between destination nodes, what is the minimum distance that connects all the nodes?

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called

Introduction to Quantitative Analysis

Probability Concepts and Applications

Decision Analysis

Regression Models

Forecasting

Inventory Control Models

Linear Programming Models: Graphical and Computer Methods

Linear Programming Applications

Transportation and Assignment Models

Integer Programming, Goal Programming, and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Filters