Exam 23: Transportation, Assignment, and Network Algorithms

A logistics company is determining the shortest route to get to a selected final destination.The information on possible paths and distances is given below:

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

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

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

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

The maximal-flow technique might be used

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

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

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

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

The maximal-flow technique would best be used

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.

It is possible to find an optimal solution to a transportation problem that is degenerate.

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

Which technique requires that we start in the upper-left-hand cell of the table and allocate units to shipping routes in a "stair step" fashion?

Which of the following techniques can be used for moving from an initial feasible solution to an optimal solution in a transportation problem?

Table M8-7 -Table M8-7 illustrates a(n)

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

In a transportation problem,degeneracy occurs when

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.