Question 1

Which of the following is not part of the transportation algorithm?

Accepted Answer

A) northwest corner rule 
B) stepping-stone method 
C) balanced transportation table 
D) portfolio selection 
E) Hungarian method 
A) northwest corner rule 
B) stepping-stone method 
C) balanced transportation table 
D) portfolio selection 
E) Hungarian method

Question 2

The second 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) decrease the flow as much as possible. 
D) add capacity to the path with minimum flow. 
E) find the arc on the previously chosen path with the smallest flow capacity available. 
A) pick the node with the maximum flow. 
B) pick any path with some flow. 
C) decrease the flow as much as possible. 
D) add capacity to the path with minimum flow. 
E) find the arc on the previously chosen path with the smallest flow capacity available.

Question 3

Table M8-6  
-In Table M8-6,if cell A3 is filled on the next iteration,what is the improvement in the objective function?

Accepted Answer

A) 60 
B) 30 
C) 530 
D) 590 
E) None of the above 
A) 60 
B) 30 
C) 530 
D) 590 
E) None of the above

Question 4

Table M8-10  
-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 5

Find the shortest route from Node 1 to Node 6.

Accepted Answer

A) total distance = 350 
B) total distance = 410 
C) total distance = 270 
D) total distance = 520 
E) None of the above 
A) total distance = 350 
B) total distance = 410 
C) total distance = 270 
D) total distance = 520 
E) None of the above

Question 6

When is a dummy destination added to a transportation problem?

Accepted Answer

when total

Question 7

After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,

Accepted Answer

A) once you make that improvement,you would definitely have an optimal solution. 
B) you would make that improvement and then check all unused cells again. 
C) you could stop because you already had the optimal solution. 
D) you should check to be sure that you don't have to add a dummy source or dummy destination. 
E) None of the above 
A) once you make that improvement,you would definitely have an optimal solution. 
B) you would make that improvement and then check all unused cells again. 
C) you could stop because you already had the optimal solution. 
D) you should check to be sure that you don't have to add a dummy source or dummy destination. 
E) None of the above

Question 8

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Accepted Answer

A) True 
 B)False

Question 9

Table M8-12  
-Given Table M8-12,the final table for an assignment problem,who should be assigned to job 2?

Accepted Answer

A) worker A 
B) worker C 
C) either worker A or worker C 
D) neither worker A nor worker C 
E) worker D 
A) worker A 
B) worker C 
C) either worker A or worker C 
D) neither worker A nor worker C 
E) worker D

Question 10

Practically speaking,multiple optimal solutions

Accepted Answer

A) are infeasible. 
B) are unbounded. 
C) are degenerate. 
D) are unbalanced. 
E) provide management with greater flexibility in selecting and using resources. 
A) are infeasible. 
B) are unbounded. 
C) are degenerate. 
D) are unbalanced. 
E) provide management with greater flexibility in selecting and using resources.

Question 11

The assignment problem is a special case of the transportation problem.So,then,why is it not recommended to use the transportation algorithm to solve the assignment problem?

Accepted Answer

It would r

Question 12

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Accepted Answer

A) True 
 B)False

Question 13

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown.What is the peak air traffic load (From City 1 to City 5)in aircraft per hour that this system can handle?

Accepted Answer

Route 1-2-3-5 can handle 200 p

Question 14

Table M8-11  
-A company must assign mechanics to each of four jobs.The time involved varies according to individual abilities.Table M8-11 shows how many minutes it takes each mechanic to perform each job.If the optimal assignments are made,how many total minutes would be required for completing the jobs?

Accepted Answer

A) 0 
B) 4 
C) 17 
D) 16 
E) None of the above 
A) 0 
B) 4 
C) 17 
D) 16 
E) None of the above

Question 15

Which of the following methods is used only with the assignment problem?

Accepted Answer

A) the Hungarian method 
B) stepping-stone method 
C) MODI method 
D) Vogel's approximation method 
E) the simplex method 
A) the Hungarian method 
B) stepping-stone method 
C) MODI method 
D) Vogel's approximation method 
E) the simplex method

Question 16

Describe the steps of the shortest-route technique.

Accepted Answer

(1)Find the nearest node to the origin (

Question 17

An artificial source added to a transportation table when total demand is greater than total supply is called

Accepted Answer

A) excess source. 
B) filler source. 
C) dummy source. 
D) demand source. 
E) supply source. 
A) excess source. 
B) filler source. 
C) dummy source. 
D) demand source. 
E) supply source.

Question 18

A typical transportation problem may ask the question,"How many of X should be shipped to point E from source A?"

Accepted Answer

A) True 
 B)False

Question 19

Table M8-1  
-What is the value of the improvement index for cell B1 shown in Table M8-1?

Accepted Answer

A) -50 
B) +3 
C) +2 
D) +1 
E) None of the above 
A) -50 
B) +3 
C) +2 
D) +1 
E) None of the above

Question 20

Objectives of the assignment problem can include

Accepted Answer

A) minimize total costs. 
B) minimize total time to perform the tasks at hand. 
C) minimize opportunity costs. 
D) maximize profit. 
E) All of the above 
A) minimize total costs. 
B) minimize total time to perform the tasks at hand. 
C) minimize opportunity costs. 
D) maximize profit. 
E) All of the above

Exam 23: Transportation, Assignment, and Network Algorithms

Which of the following is not part of the transportation algorithm?

The second step in the maximal-flow technique is to

Table M8-6 -In Table M8-6,if cell A3 is filled on the next iteration,what is the improvement in the objective function?

Table M8-10 -What is said to exist when total demand equals total supply in a transportation problem?

Find the shortest route from Node 1 to Node 6.

When is a dummy destination added to a transportation problem?

After testing each unused cell by the stepping-stone method in the transportation problem and finding only one cell with a negative improvement index,

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Table M8-12 -Given Table M8-12,the final table for an assignment problem,who should be assigned to job 2?

Practically speaking,multiple optimal solutions

The assignment problem is a special case of the transportation problem.So,then,why is it not recommended to use the transportation algorithm to solve the assignment problem?

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

The west-to-east air traffic system passing through the United States can handle aircraft flows with capacities in hundreds of planes per hour as shown.What is the peak air traffic load (From City 1 to City 5)in aircraft per hour that this system can handle?

Which of the following methods is used only with the assignment problem?

Describe the steps of the shortest-route technique.

An artificial source added to a transportation table when total demand is greater than total supply is called

A typical transportation problem may ask the question,"How many of X should be shipped to point E from source A?"

Table M8-1 -What is the value of the improvement index for cell B1 shown in Table M8-1?

Objectives of the assignment problem can include

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