Question 1

The minimal-spanning tree technique would best be used

Accepted Answer

A) by a forest ranger seeking to minimize the risk of forest fires. 
B) by a telephone company attempting to lay out wires in a new housing development. 
C) by an airline laying out flight routes. 
D) None of the above 
E) All of the above 
A) by a forest ranger seeking to minimize the risk of forest fires. 
B) by a telephone company attempting to lay out wires in a new housing development. 
C) by an airline laying out flight routes. 
D) None of the above 
E) All of the above

Question 2

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 3

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 
E) None of the above 
A) 1200 
B) 1400 
C) 900 
D) 800 
E) None of the above

Question 4

As part of the planning for a major office development project,it is necessary to install telephone lines 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

Connect: 1-4,4-5,5-7,3-6,5-3,a

Question 5

The points on the network are referred to as nodes.

Accepted Answer

A) True 
 B)False

Question 6

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

Accepted Answer

A) True 
 B)False

Question 7

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

Accepted Answer

A) True 
 B)False

Question 8

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

Accepted Answer

(a)Connect

Question 9

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

Accepted Answer

A) True 
 B)False

Question 10

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 11

Table 9-1  
-A company must assign mechanics to each of four jobs.The time involved varies according to individual abilities.Table 9-1 shows how many minutes it takes each mechanic to perform each job.If the optimal assignments are made,how many total minutes would be required for completing the jobs?

Accepted Answer

A) 0 
B) 4 
C) 17 
D) 16 
E) None of the above 
A) 0 
B) 4 
C) 17 
D) 16 
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

The minimal-spanning tree technique finds the shortest route to a series of destinations.

Accepted Answer

A) True 
 B)False

Question 14

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 15

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Accepted Answer

A) 300 
B) 525 
C) 675 
D) 1925 
E) None of the above 
A) 300 
B) 525 
C) 675 
D) 1925 
E) None of the above

Question 16

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

Question 17

The maximal-flow technique would best be used

Accepted Answer

A) to assign workers to jobs in the cheapest manner. 
B) to determine the number of units to ship from each source to each destination. 
C) to determine LAN network wiring within a building. 
D) to maximize traffic flow on a busy highway. 
E) by a trucking company making frequent but repeatable drops. 
A) to assign workers to jobs in the cheapest manner. 
B) to determine the number of units to ship from each source to each destination. 
C) to determine LAN network wiring within a building. 
D) to maximize traffic flow on a busy highway. 
E) by a trucking company making frequent but repeatable drops.

Question 18

A cable company must provide service for 7 houses in a particular neighborhood.They would like to wire the neighborhood in a way to minimize the wiring costs (or distance).How should the cable company wire the neighborhood and what would be the minimal length of the network?

Accepted Answer

One solution is to c

Question 19

The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance.

Accepted Answer

A) True 
 B)False

Question 20

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

Accepted Answer

A) 900 
B) 650 
C) 400 
D) 1200 
E) None of the above 
A) 900 
B) 650 
C) 400 
D) 1200 
E) None of the above

Exam 9: Transportation,assignment,and Network Models

The minimal-spanning tree technique would best be used

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

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

The points on the network are referred to as nodes.

The maximal-flow model might be of use to an engineer looking for spare capacity in an oil pipeline system.

The objective of an assignment problem solution most often is to minimize the total costs or time of performing the assigned tasks.

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

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

The shortest-route technique would best be used to

The minimal-spanning tree technique finds the shortest route to a series of destinations.

Find the shortest route from Node 1 to Node 6.

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

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

The maximal-flow technique would best be used

A cable company must provide service for 7 houses in a particular neighborhood.They would like to wire the neighborhood in a way to minimize the wiring costs (or distance).How should the cable company wire the neighborhood and what would be the minimal length of the network?

The minimal-spanning tree technique determines the path through the network that connects all the points while minimizing total distance.

Given the following distances between destination nodes,what is the minimum distance that connects all the nodes?

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