Question 1

Describe the steps of the shortest-route technique.

Accepted Answer

(1) Find the nearest node to the origin

Question 2

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

Accepted Answer

A) True 
 B)False

Question 3

Brantley College has decided to "wire" its campus. The first stage in this effort is to install the "backbone," i.e., to connect all the buildings. The table below gives the distances between the various buildings on campus in hundreds of feet. How should the buildings be connected to minimize the total length of cable? What length of cable is required?

Accepted Answer

Connect: 1-2, 2-4, 4

Question 4

Transportation companies would definitely be interested in the shortest-route technique to optimize travel.

Accepted Answer

A) True 
 B)False

Question 5

As part of the planning for a major office development project, it is necessary to install telephone line to the buildings. Information about the project is given below. The distances are provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e., total distance) are minimized? What is the total length of this?

Accepted Answer

One solution is to c

Question 6

The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance.

Accepted Answer

A) True 
 B)False

Question 7

All the nodes must be connected in which of the following techniques?

Accepted Answer

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

Question 8

Busy highways are often analyzed with the maximal-flow technique.

Accepted Answer

A) True 
 B)False

Question 9

The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible, rather than attempting to connect all the nodes in the model.

Accepted Answer

A) True 
 B)False

Question 10

Which of the following techniques is not discussed in Chapter 11?

Accepted Answer

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

Question 11

The shortest-route technique is the same as the minimal-spanning tree technique.

Accepted Answer

A) True 
 B)False

Question 12

The maximal-flow technique might be used

Accepted Answer

A)  to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. 
B)  by someone designing the traffic approaches to an airport. 
C)  by someone attempting to design roads that would limit the flow of traffic through an area. 
D)  All of the above 
E)  None of the above 
A)  to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. 
B)  by someone designing the traffic approaches to an airport. 
C)  by someone attempting to design roads that would limit the flow of traffic through an area. 
D)  All of the above 
E)  None of the above

Question 13

As part of the planning for a major office development project, it is necessary to install telephone lines to the buildings. Information about the project is given below. The distances are provided in hundreds of feet. Which offices should be connected so that total wiring costs (i.e., total distance) are minimized? What is the total length of this?

Accepted Answer

Connect: 1-4, 4-5, 5-7, 3-6, 5

Question 14

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Accepted Answer

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

Question 15

Find the shortest route from Node 1 to Node 4 using the shortest-route technique.

Accepted Answer

A)  650 
B)  450 
C)  550 
D)  500 
E)  800 
A)  650 
B)  450 
C)  550 
D)  500 
E)  800

Question 16

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

Accepted Answer

A)  200 
B)  300 
C)  600 
D)  700 
E)  None of the above 
A)  200 
B)  300 
C)  600 
D)  700 
E)  None of the above

Question 17

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

Accepted Answer

A)  450 
B)  150 
C)  350 
D)  650 
E)  None of the above 
A)  450 
B)  150 
C)  350 
D)  650 
E)  None of the above

Question 18

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

Accepted Answer

A)  900 
B)  1200 
C)  1100 
D)  700 
E)  None of the above 
A)  900 
B)  1200 
C)  1100 
D)  700 
E)  None of the above

Question 19

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

Accepted Answer

A) True 
 B)False

Question 20

The points on the network are referred to as nodes.

Accepted Answer

A) True 
 B)False

Describe the steps of the shortest-route technique.

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

Transportation companies would definitely be interested in the shortest-route technique to optimize travel.

The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance.

All the nodes must be connected in which of the following techniques?

Busy highways are often analyzed with the maximal-flow technique.

The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible, rather than attempting to connect all the nodes in the model.

Which of the following techniques is not discussed in Chapter 11?

The shortest-route technique is the same as the minimal-spanning tree technique.

The maximal-flow technique might be used

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Find the shortest route from Node 1 to Node 4 using the shortest-route technique.

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?

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

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

The points on the network are referred to as nodes.

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

Describe the steps of the shortest-route technique.

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

Transportation companies would definitely be interested in the shortest-route technique to optimize travel.

The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance.

All the nodes must be connected in which of the following techniques?

Busy highways are often analyzed with the maximal-flow technique.

The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible, rather than attempting to connect all the nodes in the model.

Which of the following techniques is not discussed in Chapter 11?

The shortest-route technique is the same as the minimal-spanning tree technique.

The maximal-flow technique might be used

Given the pipeline fluid flows indicated below, determine the maximum flow from Node 1 to Node 5.

Find the shortest route from Node 1 to Node 4 using the shortest-route technique.

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?

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

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

The points on the network are referred to as nodes.

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