Question 1

The maximal-flow technique might be used

Accepted Answer

A) to help design the least expensive blend of grains to prepare a run of chicken feed at a mill. 
B) by someone designing the traffic approaches to an airport. 
C) by someone attempting to design roads that minimize the cubic feet of asphalt required. 
D) to maximize the profit of the fall line of handbags. 
A) to help design the least expensive blend of grains to prepare a run of chicken feed at a mill. 
B) by someone designing the traffic approaches to an airport. 
C) by someone attempting to design roads that minimize the cubic feet of asphalt required. 
D) to maximize the profit of the fall line of handbags.

Question 2

The maximal-flow model assumes that there is a net flow from "sink" to "source."

Accepted Answer

A) True 
 B)False

Question 3

Table M8-15
A sprinkler service is analyzing the flow of water through pipes in your front yard.The flow capacities are given in the table below.Flow is measured in 100 gallons/hour.
  
-Use the information in Table M8-15.In order to achieve maximal flow from node 1 to node 7, what should the flow from node 2 to node 4 be?

Accepted Answer

A) -700 gallons/hour 
B) 700 gallons/hour 
C) 1100 gallons/hour 
D) 0 gallons/hour 
A) -700 gallons/hour 
B) 700 gallons/hour 
C) 1100 gallons/hour 
D) 0 gallons/hour

Question 4

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

Accepted Answer

A) 200 
B) 300 
C) 600 
D) 700 
A) 200 
B) 300 
C) 600 
D) 700

Question 5

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

Question 6

When is a dummy destination added to a transportation problem?

Accepted Answer

when total

Question 7

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 
A) max flow = 4 units 
B) max flow = 6 units 
C) max flow = 3 units 
D) max flow = 9 units

Question 8

Find the shortest route from Node 1 to Node 4.

Accepted Answer

A) 750 
B) 500 
C) 550 
D) 600 
A) 750 
B) 500 
C) 550 
D) 600

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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 
A) 100 
B) 150 
C) 200 
D) 50

Question 11

Transportation models can be used for which of the following decisions?

Accepted Answer

A) facility location 
B) production mix 
C) media selection 
D) portfolio selection 
A) facility location 
B) production mix 
C) media selection 
D) portfolio selection

Question 12

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 13

A certain firm has four different operations that must be assigned to four locations.The profit (in thousands of dollars)associated with each operation at each location is presented below.The firm's vice president would like to assign the various operations so that the total profit is maximized.Find the appropriate assignments.

Accepted Answer

Assign W to 2, X to

Question 14

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

Accepted Answer

A) True 
 B)False

Question 15

SE Appliances manufactures 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 16

In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a dummy source is given a very high cost.

Accepted Answer

A) True 
 B)False

Question 17

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. 
A) uncertainty or inexperience. 
B) total costs or inexperience. 
C) total costs or total time. 
D) total time or inexperience.

Question 18

In a transportation problem, each destination must be supplied by one and only one source.

Accepted Answer

A) True 
 B)False

Question 19

Which of the following is not considered a special situation with the transportation algorithm?

Accepted Answer

A) unbalanced transportation problems 
B) degeneracy 
C) unconstrained transportation problems 
D) more than one optimal solution 
A) unbalanced transportation problems 
B) degeneracy 
C) unconstrained transportation problems 
D) more than one optimal solution

Question 20

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

Accepted Answer

A) 300 
B) 400 
C) 600 
D) 500 
A) 300 
B) 400 
C) 600 
D) 500

The maximal-flow technique might be used

The maximal-flow model assumes that there is a net flow from "sink" to "source."

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

In the transportation problem, using the stepping-stone method

When is a dummy destination added to a transportation problem?

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

Find the shortest route from Node 1 to Node 4.

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

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

Transportation models can be used for which of the following decisions?

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

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a dummy source is given a very high cost.

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

In a transportation problem, each destination must be supplied by one and only one source.

Which of the following is not considered a special situation with the transportation algorithm?

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

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

The maximal-flow technique might be used

The maximal-flow model assumes that there is a net flow from "sink" to "source."

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

In the transportation problem, using the stepping-stone method

When is a dummy destination added to a transportation problem?

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

Find the shortest route from Node 1 to Node 4.

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

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

Transportation models can be used for which of the following decisions?

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

Maximization assignment problems can easily be converted to minimization problems by subtracting each rating from the largest rating in the table.

In a transportation problem, a dummy source is given a zero cost, while in an assignment problem, a dummy source is given a very high cost.

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

In a transportation problem, each destination must be supplied by one and only one source.

Which of the following is not considered a special situation with the transportation algorithm?

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

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