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

As part of the planning for a major office development project,it is necessary to install telephone line to the buildings.Information about the project is given below.The distances are provided in hundreds of feet.Which offices should be connected so that total wiring costs (i.e. ,total distance)are minimized? What is the total length of this?

Accepted Answer

One solution is to c

Question 3

If items being transported must go through an intermediate point before reaching a final destination,then this situation is known as a(n)

Accepted Answer

A) transshipment problem. 
B) assignment problem. 
C) transportation problem. 
D) intermediate point problem. 
E) None of the above 
A) transshipment problem. 
B) assignment problem. 
C) transportation problem. 
D) intermediate point problem. 
E) None of the above

Question 4

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

Accepted Answer

A) 650 
B) 450 
C) 550 
D) 500 
E) 800 
A) 650 
B) 450 
C) 550 
D) 500 
E) 800

Question 5

If your goal was to construct a network in which all points were connected and the distance between them was as short as possible,the technique that you would use is

Accepted Answer

A) shortest-route. 
B) maximal-flow. 
C) shortest-spanning tree. 
D) minimal-flow. 
E) minimal-spanning tree. 
A) shortest-route. 
B) maximal-flow. 
C) shortest-spanning tree. 
D) minimal-flow. 
E) minimal-spanning tree.

Question 6

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 7

Four projects must be completed,and each of four employees will be assigned to work on exactly one of the four projects.The table below presents an estimate of the cost that each employee would incur if working on the respective projects.What is the minimum-cost assignment of workers to projects?

Accepted Answer

Mary to Project 2,El

Question 8

When using a general LP model for transportation problems,if there are 4 sources and 3 destinations,which of the following statements is true?

Accepted Answer

A) There are typically 4 decision variables and 3 constraints. 
B) There are typically 12 decision variables and 7 constraints. 
C) There are typically 7 decision variables and 7 constraints. 
D) There are typically 12 decision variables and 12 constraints. 
E) There are typically 12 decision variables and 3 constraints. 
A) There are typically 4 decision variables and 3 constraints. 
B) There are typically 12 decision variables and 7 constraints. 
C) There are typically 7 decision variables and 7 constraints. 
D) There are typically 12 decision variables and 12 constraints. 
E) There are typically 12 decision variables and 3 constraints.

Question 9

Lines connecting nodes on a network are called links.

Accepted Answer

A) True 
 B)False

Question 10

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 11

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

Accepted Answer

A) 100 
B) 150 
C) 200 
D) 50 
E) None of the above 
A) 100 
B) 150 
C) 200 
D) 50 
E) None of the above

Question 12

Which of the following statements concerning the transshipment problem are false?

Accepted Answer

A) The number of units shipped into a transshipment point should be equal to the number of units shipped out. 
B) There can be constraints on the number of units shipped out of an origin point. 
C) There can be constraints on the number of units shipped into a destination point. 
D) The transshipment problem can be solved with linear programming. 
E) Any units shipped from one origin point must all go to the same destination point. 
A) The number of units shipped into a transshipment point should be equal to the number of units shipped out. 
B) There can be constraints on the number of units shipped out of an origin point. 
C) There can be constraints on the number of units shipped into a destination point. 
D) The transshipment problem can be solved with linear programming. 
E) Any units shipped from one origin point must all go to the same destination point.

Question 13

Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses.

Accepted Answer

A) True 
 B)False

Question 14

Table 9-2  
-Given Table 9-2,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 15

Neki Sports Company manufactures treadmills in factories located in Pittsburgh and Kansas City.These are shipped to regional distribution centers in Chicago,Phoenix,and Philadelphia.Ultimately they are delivered to supply houses in New York and Los Angeles.The available supplies at the factories,demands at the final destinations,and shipping costs are illustrated in the table below.   Formulate this problem as a linear program.

Accepted Answer

Let (1)= Pittsburgh, (2)= Kansas City, (

Question 16

The maximal-flow technique might be used

Accepted Answer

A) to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. 
B) by someone designing the traffic approaches to an airport. 
C) by someone attempting to design roads that would limit the flow of traffic through an area. 
D) All of the above 
E) None of the above 
A) to help design the moving sidewalks transporting passengers from one terminal to another in a busy airport. 
B) by someone designing the traffic approaches to an airport. 
C) by someone attempting to design roads that would limit the flow of traffic through an area. 
D) All of the above 
E) None of the above

Question 17

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

Accepted Answer

A) True 
 B)False

Question 18

The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible,rather than attempting to connect all the nodes in the model.

Accepted Answer

A) True 
 B)False

Question 19

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 20

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 above 
A) 100 
B) 400 
C) 500 
D) 700 
E) None of the above

Exam 9: Transportation,assignment,and Network Models

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

If items being transported must go through an intermediate point before reaching a final destination,then this situation is known as a(n)

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

If your goal was to construct a network in which all points were connected and the distance between them was as short as possible,the technique that you would use is

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

Four projects must be completed,and each of four employees will be assigned to work on exactly one of the four projects.The table below presents an estimate of the cost that each employee would incur if working on the respective projects.What is the minimum-cost assignment of workers to projects?

When using a general LP model for transportation problems,if there are 4 sources and 3 destinations,which of the following statements is true?

Lines connecting nodes on a network are called links.

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

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

Which of the following statements concerning the transshipment problem are false?

Cable television companies would employ the shortest-route technique to lay out the cables connecting individual houses.

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

The maximal-flow technique might be used

The objective of a transportation problem solution is to schedule shipments from sources to destinations while minimizing total transportation and production costs.

The shortest-route model assumes that one is trying to connect two end points in the shortest manner possible,rather than attempting to connect all the nodes in the model.

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?

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

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