Question 1

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 aboveF) All of the above
G) A) and B)

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)   sinkF) A) and B)
G) A) and E)

Question 3

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 aboveF) A) and C)
G) B) and C)

Question 4

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 5

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 aboveF) B) and D)
G) A) and B)

Question 6

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.F) B) and C)
G) A) and B)

Question 7

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 8

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 aboveF) A) and B)
G) A) and C)

Question 9

Find the shortest route from Node 1 to Node 5.

Accepted Answer

A)   200
B)   350
C)   250
D)   450
E)   None of the aboveF) A) and E)
G) A) and C)

Question 10

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)   sourceF) B) and E)
G) C) and D)

Question 11

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 CF) A) and B)
G) A) and C)

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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 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 aboveF) A) and D)
G) A) and E)

Question 15

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 aboveF) None of the above
G) B) and D)

Question 16

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 aboveF) All of the above
G) A) and B)

Question 17

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 18

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 aboveF) D) and E)
G) A) and D)

Question 19

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

Accepted Answer

A)   home
B)   delta
C)   source
D)   mouth
E)   sinkF) D) and E)
G) A) and E)

Question 20

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

Accepted Answer

A) True 
 B)False

Exam 11: Network Models

Find the shortest route from Node 1 to Node 6.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Find the shortest route from Node 1 to Node 5.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The minimal-spanning technique would best be used

Correct AnswerverifiedShow Answer

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.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

Find the shortest route from Node 6 to Node 1.

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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.

Correct Answerverified(a) Connec...View AnswerShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

The shortest-route technique might be logically used for

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
(a) Connec...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified