Question 1

In solving maximization assignment problems,

Accepted Answer

A) just reverse all the decision rules used in the minimizing algorithm (if it says subtract,now add,and so on). 
B) convert the problem to an equivalent minimization problem. 
C) use the Australian transformation process and convert the data. 
D) All of the above 
E) None of the above 
A) just reverse all the decision rules used in the minimizing algorithm (if it says subtract,now add,and so on). 
B) convert the problem to an equivalent minimization problem. 
C) use the Australian transformation process and convert the data. 
D) All of the above 
E) None of the above B

Question 2

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 3

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  True

Question 4

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 
E) employee shift scheduling 
A) facility location 
B) production mix 
C) media selection 
D) portfolio selection 
E) employee shift scheduling

Question 5

In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method,one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.

Accepted Answer

A) True 
 B)False

Question 6

Which of the following accurately describes steps of the northwest corner rule,after making the initial allocation of units in the northwest cell?

Accepted Answer

A) Move down first,and then move right. 
B) Move right first,and then move down. 
C) Move right or down first,depending on whether the demand requirement or the supply capacity,respectively,is exhausted first. 
D) Move right or down first,depending on whether the supply capacity or the demand requirement,respectively,is exhausted first. 
E) Move diagonally first. 
A) Move down first,and then move right. 
B) Move right first,and then move down. 
C) Move right or down first,depending on whether the demand requirement or the supply capacity,respectively,is exhausted first. 
D) Move right or down first,depending on whether the supply capacity or the demand requirement,respectively,is exhausted first. 
E) Move diagonally first.

Question 7

What is meant by a balanced transportation problem?

Accepted Answer

a situation in which

Question 8

The shortest-route technique would best be used to

Accepted Answer

A) plan the routes for a vacation driving tour. 
B) plan the route for a school bus. 
C) determine the path for a truck making frequent runs from a factory to a warehouse. 
D) All of the above 
E) None of the above 
A) plan the routes for a vacation driving tour. 
B) plan the route for a school bus. 
C) determine the path for a truck making frequent runs from a factory to a warehouse. 
D) All of the above 
E) None of the above

Question 9

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

Question 10

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. 
E) None of the above 
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. 
E) None of the above

Question 11

Find the shortest route from Node 1 to Node 6.

Accepted Answer

A) 300 
B) 450 
C) 550 
D) 650 
E) None of the above 
A) 300 
B) 450 
C) 550 
D) 650 
E) None of the above

Question 12

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 4

Question 13

In a transportation problem,a single source may supply something to all destinations.

Accepted Answer

A) True 
 B)False

Question 14

The final node or destination in a network is called a(n)

Accepted Answer

A) arc. 
B) branch. 
C) source. 
D) mouth. 
E) sink. 
A) arc. 
B) branch. 
C) source. 
D) mouth. 
E) sink.

Question 15

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. 
E) None of the above 
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. 
E) None of the above

Question 16

Find the shortest route from Node 1 to Node 4.

Accepted Answer

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

Question 17

Busy highways are often analyzed with the maximal-flow technique.

Accepted Answer

A) True 
 B)False

Question 18

Transportation models may be used when a firm is trying to decide where to locate a new facility.

Accepted Answer

A) True 
 B)False

Question 19

Given a network with the following distances:   (a)Determine which nodes should be connected to get the minimum distance flowing from Node 1 through Node 7.
(b)Determine the minimum distance.

Accepted Answer

(a)Connect

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 23: Transportation, Assignment, and Network Algorithms

In solving maximization assignment problems,

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

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

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

In finding the maximum quantity that can be shipped on the least costly route using the stepping-stone method,one examines the closed path of plus and minus signs drawn and selects the smallest number found in those squares containing minus signs.

Which of the following accurately describes steps of the northwest corner rule,after making the initial allocation of units in the northwest cell?

What is meant by a balanced transportation problem?

The shortest-route technique would best be used to

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.

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

Find the shortest route from Node 1 to Node 6.

In a transportation problem,a single source may supply something to all destinations.

The final node or destination in a network is called a(n)

The first step in the maximal-flow technique is to

Find the shortest route from Node 1 to Node 4.

Busy highways are often analyzed with the maximal-flow technique.

Transportation models may be used when a firm is trying to decide where to locate a new facility.

Given a network with the following distances: (a)Determine which nodes should be connected to get the minimum distance flowing from Node 1 through Node 7. (b)Determine the minimum distance.

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

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