Exam 23: Transportation, Assignment, and Network Algorithms

Table M8-2 -In Table M8-2, cell A3 should be selected to be filled in the next solution.If this was selected as the cell to be filled, and the next solution was found using the appropriate stepping-stone path, how many units would be assigned to this cell?

The second step in the maximal-flow technique is to

If we want to quickly arrive at a "feasible," but not necessarily "optimal" solution to the transportation problem, we will use the

In using the stepping-stone method, the path can turn at any box or cell that is unoccupied.

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, what should Lee do in order to minimize overall total cost?

Four projects must be completed, and each of four employees will be assigned to work on exactly one of the four projects.The table below presents an estimate of the cost that each employee would incur if working on the respective projects.What is the minimum-cost assignment of workers to projects?

Which of the following is not a step in the Hungarian method of assignment?

Table M8-15 A sprinkler service is analyzing the flow of water through pipes in your front yard.The flow capacities are given in the table below.Flow is measured in 100 gallons/hour. -Use the information in Table M8-15.In order to achieve maximal flow from node 1 to node 7, what should the flow from node 1 to node 4 be?

Find the shortest route from Node 1 to Node 6.

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 5 in the transportation network represented in Table M8-16.

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

Hercules decides to hire seven painters to complete seven of his labors and bargains with each to determine the best price he can get.What is the minimum cost to complete these labors and which painter must complete which labor? All numbers in the table are the costs (in Drachmas).

A water company is analyzing the flow of water through pipes in an office building.The flow capacities are given in the table below.Flow is measured in 100 gallons/hour.What is the maximal flow of water from node 1 to node 5?

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.

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

Table M8-18 LW Enterprises is a specialty cat breeder with operations located in Wichita, Oklahoma City, Nashville, Lubbock and Enumclaw.These cats are used as historical reenactors on US Civil War battlefields throughout the summer months.Clad in Union blue or Confederate gray and equipped with their tiny rifles and saucers of milk, they thrill crowds of Civil War buffs from Gettysburg all the way down to Vicksburg.The cost (in dollars)of shipping each cat from all possible combinations of supply and demand locations is shown in the table. -Where does Nashville ship most of their cats in order to minimize the overall total cost of shipping for the scenario presented in Table M8-18?

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, what is the best price possible for Mr.Miyagi?

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

Find the shortest route from Node 6 to Node 1.

The Hungarian method is designed to solve transportation problems efficiently.