Question 1

When using the shortest-route technique, the first step is to

Accepted Answer

A) connect the nearest node that minimizes the total distance to the origin. 
B) trace the path from the warehouse to the plant. 
C) determine the average distance traveled from source to end. 
D) find the nearest node to the origin and put a distance box by the node. 
A) connect the nearest node that minimizes the total distance to the origin. 
B) trace the path from the warehouse to the plant. 
C) determine the average distance traveled from source to end. 
D) find the nearest node to the origin and put a distance box by the node.

Question 2

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

Accepted Answer

A) True 
 B)False

Question 3

The first 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) eliminate any node that has a zero flow. 
D) add a dummy flow from the start to the finish. 
A) pick the node with the maximum flow. 
B) pick any path with some flow. 
C) eliminate any node that has a zero flow. 
D) add a dummy flow from the start to the finish.

Question 4

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

Accepted Answer

A) True 
 B)False

Question 5

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.What is the maximal flow from node 1 to node 7?

Accepted Answer

1800 gallo

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

Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.

Accepted Answer

A) True 
 B)False

Question 8

LW Enterprises is a specialty cat breeder with operations located in Wichita, Oklahoma City, Nashville, Lubbock and Enumclaw.These cats are used as historical reenactors on US Civil War battlefields throughout the summer months.Clad in Union blue or Confederate gray and equipped with their tiny rifles and saucers of milk, they thrill crowds of Civil War buffs from Gettysburg all the way down to Vicksburg.The cost (in dollars)of shipping each cat from all possible combinations of supply and demand locations is shown in the table.
   How many cats should be shipped from each plant to each battlefield in order to minimize shipping costs? What is the total minimum shipping cost?

Accepted Answer

Ship 300 cats from Wichita to Antietam,

Question 9

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

Question 10

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

Accepted Answer

A) 1200 
B) 1400 
C) 900 
D) 800 
A) 1200 
B) 1400 
C) 900 
D) 800

Question 11

The shortest-route technique would best be used to

Accepted Answer

A) plan the routes for a cycling tour of North Cornwall. 
B) wire a burglar alarm in a building. 
C) cut patterns out of a bolt of cloth to minimize waste. 
D) determine which team of referees should call each game in a professional league. 
A) plan the routes for a cycling tour of North Cornwall. 
B) wire a burglar alarm in a building. 
C) cut patterns out of a bolt of cloth to minimize waste. 
D) determine which team of referees should call each game in a professional league.

Question 12

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) minimum cut problem 
A) maximal-flow problem 
B) shortest-route problem 
C) minimal-spanning tree problem 
D) minimum cut problem

Question 13

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 14

Table M8-17
Mr.Miyagi hires the Magnificent Seven to take care of a few chores around his house while he spends some quality time with his young protegee.Each of the Magnificent Seven quotes Mr.Miyagi a price for the seven tasks and Mr.Miyagi would like to pay as little as possible for all seven.
  
-Given the helpers and the tasks in Table M8-17, who should Prune Tree in order to minimize the overall total cost?

Accepted Answer

A) Lee 
B) Bernardo 
C) Britt 
D) Chico 
A) Lee 
B) Bernardo 
C) Britt 
D) Chico

Question 15

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 16

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 17

Table M8-16
A transportation network consists of ten branches connecting seven nodes as shown in the table.
  
-What is the shortest route from Node 1 to Node 5 in the transportation network represented in Table M8-16.

Accepted Answer

A) 58 
B) 50 
C) 44 
D) 39 
A) 58 
B) 50 
C) 44 
D) 39

Question 18

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) Only r + c-1 squares can be used as a "stepping-stone." 
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) Only r + c-1 squares can be used as a "stepping-stone."

Question 19

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

Accepted Answer

A) True 
 B)False

Question 20

One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.

Accepted Answer

A) True 
 B)False

Exam 23: Transportation, Assignment, and Network Algorithms

When using the shortest-route technique, the first step is to

The shortest-route technique might be used by someone planning a vacation in order to minimize the required amount of driving.

The first step in the maximal-flow technique is to

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

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.What is the maximal flow from node 1 to node 7?

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

Assignment problems involve determining the most efficient assignment of people to projects, salesmen to territories, contracts to bidders, and so on.

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

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

The shortest-route technique would best be used to

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

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

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?

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?

Table M8-16 A transportation network consists of ten branches connecting seven nodes as shown in the table. -What is the shortest route from Node 1 to Node 5 in the transportation network represented in Table M8-16.

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

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

One of the advantages of the stepping-stone method is that if, at a particular iteration, we accidentally choose a route that is not the best, the only penalty is to perform additional iterations.

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