Question 1

In the minimal-spanning tree technique, if there is a tie for the nearest node, that suggests that there may be more than one optimal solution.

Accepted Answer

A) True 
 B)False

Question 2

A line in a network that may represent a path or a route is called a(n) ________.

Accepted Answer

A)  arc 
B)  branch 
C)  line 
D)  fork 
E)  sink 
A)  arc 
B)  branch 
C)  line 
D)  fork 
E)  sink

Question 3

In the minimal-spanning tree technique, it is necessary to start at the last node in the network.

Accepted Answer

A) True 
 B)False

Question 4

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

Accepted Answer

A) True 
 B)False

Question 5

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

Accepted Answer

A)  1200 
B)  1400 
C)  900 
D)  800 
E)  None of the above 
A)  1200 
B)  1400 
C)  900 
D)  800 
E)  None of the above

Question 6

The shortest-route technique might be logically used for

Accepted Answer

A)  finding the longest time to travel between two points. 
B)  finding the shortest travel distance between two points. 
C)  finding the most scenic route to allow travel to several places during a trip on spring break. 
D)  connecting all the points of a network together while minimizing the distance between them. 
E)  None of the above 
A)  finding the longest time to travel between two points. 
B)  finding the shortest travel distance between two points. 
C)  finding the most scenic route to allow travel to several places during a trip on spring break. 
D)  connecting all the points of a network together while minimizing the distance between them. 
E)  None of the above

Question 7

Which of the following problems can be solved as a linear program using binary 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 8

Find the shortest route from Node 6 to Node 1.

Accepted Answer

A)  branches 9, 7, and 2 
B)  branches 8, 6, and 2 
C)  branches 8, 6, 7, and 1 
D)  branches 9, 5, and 1 
E)  None of the above 
A)  branches 9, 7, and 2 
B)  branches 8, 6, and 2 
C)  branches 8, 6, 7, and 1 
D)  branches 9, 5, and 1 
E)  None of the above

Question 9

Given the following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point.

Accepted Answer

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

Question 10

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 11

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

Accepted Answer

A)  100 
B)  400 
C)  500 
D)  700 
E)  None of the above 
A)  100 
B)  400 
C)  500 
D)  700 
E)  None of the above

Question 12

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

Accepted Answer

(a) Connec

Question 13

The minimal-spanning technique would best be used

Accepted Answer

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

Question 14

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 15

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

Accepted Answer

A)  100 
B)  150 
C)  550 
D)  1225 
E)  None of the above 
A)  100 
B)  150 
C)  550 
D)  1225 
E)  None of the above

Question 16

Find the shortest route from Node 1 to Node 5.

Accepted Answer

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

Question 17

A point in the network, that is at the beginning or end of a route is called a(n) ________.

Accepted Answer

A)  arc 
B)  branch 
C)  line 
D)  node 
E)  source 
A)  arc 
B)  branch 
C)  line 
D)  node 
E)  source

Question 18

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

Accepted Answer

A) True 
 B)False

Question 19

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

Accepted Answer

A)  350 
B)  400 
C)  450 
D)  600 
E)  None of the above 
A)  350 
B)  400 
C)  450 
D)  600 
E)  None of the above

Question 20

The origin or beginning node in a network is called ________.

Accepted Answer

A)  home 
B)  delta 
C)  source 
D)  mouth 
E)  sink 
A)  home 
B)  delta 
C)  source 
D)  mouth 
E)  sink

In the minimal-spanning tree technique, if there is a tie for the nearest node, that suggests that there may be more than one optimal solution.

A line in a network that may represent a path or a route is called a(n) ________.

In the minimal-spanning tree technique, it is necessary to start at the last node in the network.

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

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

The shortest-route technique might be logically used for

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

Find the shortest route from Node 6 to Node 1.

Given the following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point.

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 3.

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

The minimal-spanning technique would best be used

Find the shortest route from Node 1 to Node 6.

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 Node 5.

A point in the network, that is at the beginning or end of a route is called a(n) ________.

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

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

The origin or beginning node in 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

In the minimal-spanning tree technique, if there is a tie for the nearest node, that suggests that there may be more than one optimal solution.

A line in a network that may represent a path or a route is called a(n) ________.

In the minimal-spanning tree technique, it is necessary to start at the last node in the network.

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

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

The shortest-route technique might be logically used for

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

Find the shortest route from Node 6 to Node 1.

Given the following nodes and distances, determine the minimal length of cable necessary to connect all nodes, using Node 2 as the starting point.

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 3.

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

The minimal-spanning technique would best be used

Find the shortest route from Node 1 to Node 6.

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 Node 5.

A point in the network, that is at the beginning or end of a route is called a(n) ________.

The maximal-flow technique would be helpful to city planners in determining how freeways should be expanded.

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

The origin or beginning node in 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