Deck 9: Transportation,assignment,and Network Models

Question 1

The points on the network are referred to as nodes.

Answer 1

True

Question 2

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

Answer 2

True

Question 3

The transshipment problem is a maximization problem.

Answer 3

False

Question 4

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

Question 5

The shortest-route technique is the same as the minimal-spanning tree technique.

Question 6

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

Question 7

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

Question 8

In the assignment problem,the costs for a dummy row will be equal to the lowest cost of the column for each respective cell in that row.

Question 9

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

Question 10

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

Question 11

In the minimal-spanning tree technique,it is necessary to start at the last node in the network.

Question 12

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

Question 13

A transportation problem with intermediate points is called a transshipment problem.

Question 14

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

Question 15

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

Question 16

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

Question 17

Lines connecting nodes on a network are called links.

Question 18

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

Question 19

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

Question 20

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

Question 21

A line in a network that may represent a path or a route is called a(n)

A)arc.
B)branch.
C)line.
D)fork.
E)sink.

Question 22

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

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 23

A point in the network,that is at the beginning or end of a route is called a(n)

A)arc.
B)branch.
C)line.
D)node.
E)source.

Question 24

In the minimal-spanning tree technique,if there is a tie for the nearest node,that suggests that there may be more than one optimal solution.

Question 25

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

Question 26

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

A)facility location
B)production mix
C)media selection
D)portfolio selection
E)employee shift scheduling

Question 27

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

Question 28

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

Question 29

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

A)uncertainty or inexperience.
B)total costs or inexperience.
C)total costs or total time.
D)total time or inexperience.
E)total costs or uncertainty.

Question 30

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

A)worker A
B)worker C
C)either worker A or worker C
D)neither worker A nor worker C
E)worker D

Question 31

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?

A)0
B)4
C)17
D)16
E)None of the above

Question 32

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

Question 33

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

Question 34

A traveling salesperson might use the shortest route technique to minimize the distance traveled to reach one of his/her customers.

Question 35

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.

Question 36

What is said to exist when total demand equals total supply in a transportation problem?

A)an equalized problem
B)an equilibrialized problem
C)a harmonized problem
D)a balanced problem
E)This situation can never occur.

Question 37

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)shortest-route.
B)maximal-flow.
C)shortest-spanning tree.
D)minimal-flow.
E)minimal-spanning tree.

Question 38

The maximal-flow technique might be used by the U.S.Army Corps of Engineers to study water run-off in an attempt to minimize the danger from floods.

Question 39

A technique that allows a researcher to determine the greatest amount of material that can move through a network is called

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

Question 40

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

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 41

The maximal-flow technique would best be used

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 42

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

A)100
B)750
C)850
D)900
E)None of the above

Question 43

All the nodes must be connected in which of the following techniques?

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

Question 44

The origin or beginning node in a network is called

A)home.
B)delta.
C)source.
D)mouth.
E)sink.

Question 45

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

A)find the next-nearest node to the origin and put the distance in a box by the node.
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 46

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

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

Question 47

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

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

Question 48

The shortest-route technique would best be used to

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

Question 49

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

A)200
B)300
C)600
D)700
E)None of the above

Question 50

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

A)450
B)150
C)350
D)650
E)None of the above

Question 51

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

A)100
B)400
C)500
D)700
E)None of the above

Question 52

The maximal-flow technique might be used

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 53

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

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 54

The shortest-route technique would best be used to

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 55

The first step in the maximal-flow technique is to

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 56

The minimal-spanning technique would best be used

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

Question 57

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

A)100
B)150
C)550
D)1225
E)None of the above

Question 58

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

A)maximal-flow problem
B)shortest-route problem
C)minimal-spanning tree problem
D)A and B
E)A,B,and C

Question 59

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

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

Question 60

The minimal-spanning tree technique would best be used

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 61

Given the pipeline fluid flows indicated below,determine the maximum flow from Node 1 to Node 5.

A)250
B)300
C)350
D)450
E)None of the above

Question 62

Find the shortest route from Node 1 to Node 5.

A)200
B)350
C)250
D)450
E)None of the above

Question 63

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

A)max flow = 4 units
B)max flow = 6 units
C)max flow = 3 units
D)max flow = 9 units
E)None of the above

Question 64

Find the shortest route from Node 1 to Node 6.

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

Question 65

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

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

Question 66

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

A)1000
B)800
C)700
D)1100
E)None of the above

Question 67

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

A)1200
B)1400
C)900
D)800
E)None of the above

Question 68

Find the shortest route from Node 1 to Node 4.

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

Question 69

Solve the minimal-spanning tree problem defined below:

A)total cost = 13
B)total cost = 15
C)total cost = 17
D)total cost = 11
E)None of the above

Question 70

Given the following nodes and distances,determine the minimum length of cable necessary to connect all six nodes.

A)200
B)300
C)400
D)500
E)None of the above

Question 71

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

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

Question 72

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

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

Question 73

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

A)290
B)310
C)620
D)460
E)None of the above

Question 74

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

A)300
B)400
C)600
D)500
E)None of the above

Question 75

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

A)350
B)400
C)450
D)600
E)None of the above

Question 76

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

A)900
B)1200
C)1100
D)700
E)None of the above

Question 77

Find the shortest route from Node 1 to Node 6.

A)total distance = 350
B)total distance = 410
C)total distance = 270
D)total distance = 520
E)None of the above

Question 78

Find the shortest route from Node 6 to Node 1.

A)branches 9,7,and 2
B)branches 8,6,and 2
C)branches 8,6,7,and 1
D)branches 9,5,and 1
E)None of the above

Question 79

Find the least amount of cable that will allow Jack's Cable Company to connect the following nodes (houses).

A)250
B)400
C)350
D)300
E)None of the above

Question 80

Find the shortest route from Node 1 to Node 6.

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