Question 1

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 2

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 3

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 4

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 5

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

Accepted Answer

A) True 
 B)False

Question 6

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 7

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 8

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 9

What is said to exist when total demand equals total supply in a transportation problem?

Accepted Answer

A) an equalized problem 
B) an equilibrialized problem 
C) a harmonized problem 
D) a balanced problem 
E) This situation can never occur. 
A) an equalized problem 
B) an equilibrialized problem 
C) a harmonized problem 
D) a balanced problem 
E) This situation can never occur.

Question 10

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 11

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-6

Question 12

The two most common objectives for the assignment problem are the minimization of

Accepted Answer

A) uncertainty or inexperience. 
B) total costs or inexperience. 
C) total costs or total time. 
D) total time or inexperience. 
E) total costs or uncertainty. 
A) uncertainty or inexperience. 
B) total costs or inexperience. 
C) total costs or total time. 
D) total time or inexperience. 
E) total costs or uncertainty.

Question 13

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 14

In a transportation problem,a single source may supply something to all destinations.

Accepted Answer

A) True 
 B)False

Question 15

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 16

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 17

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

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.

Question 20

In the maximal-flow technique,a zero (0)means no flow or a one-way arc.

Accepted Answer

A) True 
 B)False

Exam 9: Transportation,assignment,and Network Models

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

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

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

Solve the minimal-spanning tree problem defined below:

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

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.

Find the shortest route from Node 1 to Node 5.

The first step in the maximal-flow technique is to

What is said to exist when total demand equals total supply in a transportation problem?

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

The two most common objectives for the assignment problem are the minimization of

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

In a transportation problem,a single source may supply something to all destinations.

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

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

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

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

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

In the maximal-flow technique,a zero (0)means no flow or a one-way arc.

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

Integer Programming,goal Programming,and Nonlinear Programming

Project Management

Waiting Lines and Queuing Theory Models

Simulation Modeling

Markov Analysis

Statistical Quality Control

Analytic Hierarchy Process

Dynamic Programming

Decision Theory and the Normal Distribution

Game Theory

Mathematical Tools: Determinants and Matrices

Calculus-Based Optimization

Linear Programming: The Simplex Method

Transportation, Assignment, and Network Algorithms

Filters