Question 1

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

Accepted Answer

A)  connect the nearest node that minimizes the total distance to the origin. 
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)  connect the nearest node that minimizes the total distance to the origin. 
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 D

Question 2

The maximal-flow technique finds the maximum flow of any quantity or substance through a network.

Accepted Answer

A) True 
 B)False  True

Question 3

Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses.

Accepted Answer

A) True 
 B)False  False

Question 4

The final node or destination in a network is called a(n) ________.

Accepted Answer

A)  arc 
B)  branch 
C)  source 
D)  mouth 
E)  sink 
A)  arc 
B)  branch 
C)  source 
D)  mouth 
E)  sink

Question 5

If your goal was to construct a network in which all points were connected and the distance between them was as short as possible, the technique that you would use is

Accepted Answer

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

Question 6

The second 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)  decrease the flow as much as possible. 
D)  add capacity to the path with minimum flow. 
E)  find the arc on the previously chosen path with the smallest flow capacity available. 
A)  pick the node with the maximum flow. 
B)  pick any path with some flow. 
C)  decrease the flow as much as possible. 
D)  add capacity to the path with minimum flow. 
E)  find the arc on the previously chosen path with the smallest flow capacity available.

Question 7

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

Accepted Answer

A)  300 
B)  525 
C)  675 
D)  1925 
E)  None of the above 
A)  300 
B)  525 
C)  675 
D)  1925 
E)  None of the above

Question 8

Find the shortest route from Node 1 to each of the other nodes in the transportation network represented below.

Accepted Answer

The answer of Find the shortest route from Node 1...

Question 9

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

Accepted Answer

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

Question 10

Which of the following problems can be solved as a linear program using integer decision variables?

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 11

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

Accepted Answer

A)  100 
B)  750 
C)  850 
D)  900 
E)  None of the above 
A)  100 
B)  750 
C)  850 
D)  900 
E)  None of the above

Question 12

The maximal-flow technique would best be used

Accepted Answer

A)  to assign workers to jobs in the cheapest manner. 
B)  to determine the number of units to ship from each source to each destination. 
C)  to determine LAN network wiring within a building. 
D)  to maximize traffic flow on a busy highway. 
E)  by a trucking company making frequent but repeatable drops. 
A)  to assign workers to jobs in the cheapest manner. 
B)  to determine the number of units to ship from each source to each destination. 
C)  to determine LAN network wiring within a building. 
D)  to maximize traffic flow on a busy highway. 
E)  by a trucking company making frequent but repeatable drops.

Question 13

A logistics company is determining the shortest route to get to a selected final destination. The information on possible paths and distances is given below:

Accepted Answer

The answer of A logistics company is determining the shortest...

Question 14

We may begin the maximal-flow technique by picking an arbitrary path through the network.

Accepted Answer

A) True 
 B)False

Question 15

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load (From City 1 to City 5) in aircraft per hour that this system can handle?

Accepted Answer

Route 1235 can handle 200 per

Question 16

The east-to-west (City 5 to City 1) air traffic system passing through the U.S. can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load in aircraft per hour from City 5 to City 1 that this system can handle?

Accepted Answer

500 aircra

Question 17

The minimal-spanning tree technique would best be used

Accepted Answer

A)  by a forest ranger seeking to minimize the risk of forest fires. 
B)  by a telephone company attempting to lay out wires in a new housing development. 
C)  by an airline laying out flight routes. 
D)  None of the above 
E)  All of the above 
A)  by a forest ranger seeking to minimize the risk of forest fires. 
B)  by a telephone company attempting to lay out wires in a new housing development. 
C)  by an airline laying out flight routes. 
D)  None of the above 
E)  All of the above

Question 18

Solve the minimal-spanning tree problem defined below:

Accepted Answer

A)  total cost = 13 
B)  total cost = 15 
C)  total cost = 17 
D)  total cost = 11 
E)  None of the above 
A)  total cost = 13 
B)  total cost = 15 
C)  total cost = 17 
D)  total cost = 11 
E)  None of the above

Question 19

The shortest-route technique would best be used to

Accepted Answer

A)  plan the routes for a vacation driving tour. 
B)  plan the route for a school bus. 
C)  determine the path for a truck making frequent runs from a factory to a warehouse. 
D)  All of the above 
E)  None of the above 
A)  plan the routes for a vacation driving tour. 
B)  plan the route for a school bus. 
C)  determine the path for a truck making frequent runs from a factory to a warehouse. 
D)  All of the above 
E)  None of the above

Question 20

A water company is analyzing the flow of water through pipes in an office building. The flow capacities are given in the table below. Flow is measured in 100 gallons/hour. What is the maximal flow of water from node 1 to node 5?

Accepted Answer

700 gallon

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

The maximal-flow technique finds the maximum flow of any quantity or substance through a network.

Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses.

The final node or destination in a network is called a(n) ________.

If your goal was to construct a network in which all points were connected and the distance between them was as short as possible, the technique that you would use is

The second step in the maximal-flow technique is to

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

Find the shortest route from Node 1 to each of the other nodes in the transportation network represented below.

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

Which of the following problems can be solved as a linear program using integer decision variables?

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

The maximal-flow technique would best be used

A logistics company is determining the shortest route to get to a selected final destination. The information on possible paths and distances is given below:

We may begin the maximal-flow technique by picking an arbitrary path through the network.

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load (From City 1 to City 5) in aircraft per hour that this system can handle?

The east-to-west (City 5 to City 1) air traffic system passing through the U.S. can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load in aircraft per hour from City 5 to City 1 that this system can handle?

The minimal-spanning tree technique would best be used

Solve the minimal-spanning tree problem defined below:

The shortest-route technique would best be used to

A water company is analyzing the flow of water through pipes in an office building. The flow capacities are given in the table below. Flow is measured in 100 gallons/hour. What is the maximal flow of water from node 1 to node 5?

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

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

The maximal-flow technique finds the maximum flow of any quantity or substance through a network.

Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses.

The final node or destination in a network is called a(n) ________.

If your goal was to construct a network in which all points were connected and the distance between them was as short as possible, the technique that you would use is

The second step in the maximal-flow technique is to

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

Find the shortest route from Node 1 to each of the other nodes in the transportation network represented below.

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

Which of the following problems can be solved as a linear program using integer decision variables?

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

The maximal-flow technique would best be used

A logistics company is determining the shortest route to get to a selected final destination. The information on possible paths and distances is given below:

We may begin the maximal-flow technique by picking an arbitrary path through the network.

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load (From City 1 to City 5) in aircraft per hour that this system can handle?

The east-to-west (City 5 to City 1) air traffic system passing through the U.S. can handle aircraft flows with capacities in hundreds of planes per hour as shown. What is the peak air traffic load in aircraft per hour from City 5 to City 1 that this system can handle?

The minimal-spanning tree technique would best be used

Solve the minimal-spanning tree problem defined below:

The shortest-route technique would best be used to

A water company is analyzing the flow of water through pipes in an office building. The flow capacities are given in the table below. Flow is measured in 100 gallons/hour. What is the maximal flow of water from node 1 to node 5?

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