Exam 23: Transportation, Assignment, and Network Algorithms

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

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

The maximal-flow technique would be a useful tool when we are maximizing the cost of shipping items from a series of supply depots to regional distribution centers.

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 Paint Fence in order to minimize the overall total cost?

Table M8-3 The following improvements are proved for Table M8-3: -In Table M8-3, suppose shipping cost from source C to point 2 was 8, which below would be true?

What is meant by a balanced transportation problem?

Find the shortest route from Node 1 to Node 6.

Find the shortest route from Node 1 to Node 5.

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

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.

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.

When using the stepping-stone method, what is the maximum amount that can be shipped on the new route?

If the total supply from the sources does not equal the total demand from the destinations in the transportation problem

Practically speaking, multiple optimal solutions

In an assignment problem

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

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

Find the shortest route from Node 1 to Node 6.

A chemical engineer might use the shortest route technique to determine the amount of a solution that can be delivered between two points in a soap factory.

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