Question 1

We may begin the maximal-flow technique by picking an arbitrary path through the network.

Accepted Answer

A) True 
 B)False

Question 2

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem,we will use the

Accepted Answer

A) stepping-stone method. 
B) northwest corner rule. 
C) Vogel's approximation method. 
D) MODI method. 
E) Any of the above 
A) stepping-stone method. 
B) northwest corner rule. 
C) Vogel's approximation method. 
D) MODI method. 
E) Any of the above

Question 3

Table M8-2  
-In Table M8-2,cell A3 should be selected to be filled in the next solution.If this was selected as the cell to be filled,and the next solution was found using the appropriate stepping-stone path,how many units would be assigned to this cell?

Accepted Answer

A) 10 
B) 15 
C) 20 
D) 30 
E) None of the above 
A) 10 
B) 15 
C) 20 
D) 30 
E) None of the above

Question 4

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

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 7

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 8

Which of the following is an applicable characteristic in using the stepping-stone method?

Accepted Answer

A) Only an unoccupied square may be used as a "stepping-stone." 
B) Only an occupied square may be used as a "stepping-stone." 
C) Only the column and row with the highest factory capacity may be used as a "stepping-stone." 
D) All of the above 
E) None of the above 
A) Only an unoccupied square may be used as a "stepping-stone." 
B) Only an occupied square may be used as a "stepping-stone." 
C) Only the column and row with the highest factory capacity may be used as a "stepping-stone." 
D) All of the above 
E) None of the above

Question 9

A solution to the transportation problem can become degenerate at any iteration.

Accepted Answer

A) True 
 B)False

Question 10

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

Accepted Answer

A) True 
 B)False

Question 11

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

Accepted Answer

500 aircra

We may begin the maximal-flow technique by picking an arbitrary path through the network.

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem,we will use the

Table M8-2 -In Table M8-2,cell A3 should be selected to be filled in the next solution.If this was selected as the cell to be filled,and the next solution was found using the appropriate stepping-stone path,how many units would be assigned to this cell?

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

Find the shortest route from Node 6 to Node 1.

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

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.

Which of the following is an applicable characteristic in using the stepping-stone method?

A solution to the transportation problem can become degenerate at any iteration.

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

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

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

Exam 23: Transportation, Assignment, and Network Algorithms

We may begin the maximal-flow technique by picking an arbitrary path through the network.

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem,we will use the

Table M8-2 -In Table M8-2,cell A3 should be selected to be filled in the next solution.If this was selected as the cell to be filled,and the next solution was found using the appropriate stepping-stone path,how many units would be assigned to this cell?

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

Find the shortest route from Node 6 to Node 1.

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

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.

Which of the following is an applicable characteristic in using the stepping-stone method?

A solution to the transportation problem can become degenerate at any iteration.

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

The east-to-west (City 5 to City 1)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 in aircraft per hour from City 5 to City 1 that this system can handle?

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