Question 1

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 2

The shortest-route technique would best be used to

Accepted Answer

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

Question 3

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

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

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 6

Using the stepping-stone method to solve a maximization problem,we would choose the route with the largest positive improvement index.

Accepted Answer

A) True 
 B)False

Question 7

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

Question 8

In the transportation problem,using the stepping-stone method,

Accepted Answer

A) you may not skip over an empty cell. 
B) you may not skip over a used cell. 
C) your path may not cross over itself. 
D) if you have an optimal solution and get an improvement index of zero,there is another optimal solution. 
E) None of the above 
A) you may not skip over an empty cell. 
B) you may not skip over a used cell. 
C) your path may not cross over itself. 
D) if you have an optimal solution and get an improvement index of zero,there is another optimal solution. 
E) None of the above

Question 9

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem,

Accepted Answer

A) and if supply is greater than demand,add a dummy source or factory. 
B) the amount put in a dummy source or destination should make supply and demand equal. 
C) and if demand is greater than supply,add a dummy destination or warehouse. 
D) All of the above 
E) None of the above 
A) and if supply is greater than demand,add a dummy source or factory. 
B) the amount put in a dummy source or destination should make supply and demand equal. 
C) and if demand is greater than supply,add a dummy destination or warehouse. 
D) All of the above 
E) None of the above

Question 10

The only restriction we place on the initial solution of a transportation problem is that

Accepted Answer

A) we must have nonzero quantities in a majority of the boxes. 
B) all constraints must be satisfied. 
C) demand must be less than supply. 
D) we must have a number (equal to the number of rows plus the number of columns minus one)of boxes that contain nonzero quantities. 
E) None of the above 
A) we must have nonzero quantities in a majority of the boxes. 
B) all constraints must be satisfied. 
C) demand must be less than supply. 
D) we must have a number (equal to the number of rows plus the number of columns minus one)of boxes that contain nonzero quantities. 
E) None of the above

Question 11

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 12

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

Accepted Answer

A) True 
 B)False

Question 13

SE Appliances manufacturers refrigerators in Richmond,Charlotte,and Atlanta.Refrigerators then must be shipped to meet demand in Washington,New York,and Miami.The table below lists the shipping costs,supply,and demand information.   How many units should be shipped from each plant to each retail store in order to minimize shipping costs?

Accepted Answer

Ship 1000 units from Richmond to New Yor

Question 14

Table M8-3   The following improvements are proved for Table M8-3:  
-The cell improvement indices for Table M8-3 suggest that the optimal solution has been found.Based on this solution,how many units would actually be sent from source C?

Accepted Answer

A) 10 
B) 170 
C) 180 
D) 250 
E) None of the above 
A) 10 
B) 170 
C) 180 
D) 250 
E) None of the above

Question 15

In an assignment problem

Accepted Answer

A) the number of rows and columns must be equal. 
B) the number of rows must exceed the number of columns. 
C) the number of rows must equal or exceed the number of columns. 
D) the number of columns must equal or exceed the number of rows. 
E) None of the above 
A) the number of rows and columns must be equal. 
B) the number of rows must exceed the number of columns. 
C) the number of rows must equal or exceed the number of columns. 
D) the number of columns must equal or exceed the number of rows. 
E) None of the above

Question 16

The Hungarian method is designed to solve transportation problems efficiently.

Accepted Answer

A) True 
 B)False

Question 17

When using the stepping-stone method,what is the maximum amount that can be shipped on the new route?

Accepted Answer

A) the smallest number found in the squares with minus signs 
B) the smallest number found in the squares with plus signs 
C) the smallest number along the closed path 
D) the minimum of the demand requirement for that column and the supply capacity for that row 
E) the largest number found on the squares with minus signs 
A) the smallest number found in the squares with minus signs 
B) the smallest number found in the squares with plus signs 
C) the smallest number along the closed path 
D) the minimum of the demand requirement for that column and the supply capacity for that row 
E) the largest number found on the squares with minus signs

Question 18

Table M8-1  
-What is the total cost represented by the solution shown in Table M8-1?

Accepted Answer

A) 60 
B) 2500 
C) 2600 
D) 500 
E) None of the above 
A) 60 
B) 2500 
C) 2600 
D) 500 
E) None of the above

Question 19

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.

Question 20

Table M8-4   the next tableau will be:

Accepted Answer

A)    
B)    
C)    
D)    
E) None of the above
Answer: B
Diff: 3
Topic: THE TRANSPORTATION ALGORITHM
AACSB: Analytic Skills
Table M8-5  
-Table M8-5 represents a solution that is 
A) clearly optimal for a minimization objective. 
B) degenerate. 
C) infeasible. 
D) All of the above 
E) None of the above 
A)    
B)    
C)    
D)    
E) None of the above
Answer: B
Diff: 3
Topic: THE TRANSPORTATION ALGORITHM
AACSB: Analytic Skills
Table M8-5  
-Table M8-5 represents a solution that is 
A) clearly optimal for a minimization objective. 
B) degenerate. 
C) infeasible. 
D) All of the above 
E) None of the above

Exam 23: Transportation, Assignment, and Network Algorithms

Find the shortest route from Node 1 to Node 5.

The shortest-route technique would best be used to

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

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

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

Using the stepping-stone method to solve a maximization problem,we would choose the route with the largest positive improvement index.

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?

In the transportation problem,using the stepping-stone method,

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem,

The only restriction we place on the initial solution of a transportation problem is that

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

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

Table M8-3 The following improvements are proved for Table M8-3: -The cell improvement indices for Table M8-3 suggest that the optimal solution has been found.Based on this solution,how many units would actually be sent from source C?

In an assignment problem

The Hungarian method is designed to solve transportation problems efficiently.

When using the stepping-stone method,what is the maximum amount that can be shipped on the new route?

Table M8-1 -What is the total cost represented by the solution shown in Table M8-1?

The origin or beginning node in a network is called

Table M8-4 the next tableau will be: A) B) C) D) E)None of the above Answer: B Diff: 3 Topic: THE TRANSPORTATION ALGORITHM AACSB: Analytic Skills Table M8-5 -Table M8-5 represents a solution that is

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,assignment,and Network Models

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

Filters