Exam 9: Transportation, Assignment, and Network Models

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

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

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

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

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

The Pointy-haired boss has five projects to assign and decides to go against all convention and assign them to individuals rather than project teams.He has the Elbonians estimate the labor cost in dollars of each possible assignment and that information is summarized in the table. How many decision variables are in an LP formulation of this problem?

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

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

Find the shortest route from Node 1 to Node 6.

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.

Table 9-3 To demonstrate the personal touch that is part of the Apple experience, Tim Cook decides to personally deliver the first iCar produced in San Jose to the customer's home in Nashville.In order to minimize the carbon footprint, he decides to push the car rather than actually driving it, and since his time is valuable, he wants to choose the shortest route possible.Fortunately, the first genius he talks to at The Genius Bar is able to determine the drive times between cities Tim might pass through along the way to Nashville.The cities and drive times are shown in the table - the push time is assumed to be a direct multiple of the drive time, which will act as a surrogate to keep the numbers low. -Write the elements of the objective function relating to the city of Oklahoma City based on the information given in Table 9-3.

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

Solve the minimal-spanning tree problem defined below:

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

The Pointy-haired boss has five projects to assign and decides to go against all convention and assign them to individuals rather than project teams.He has the Elbonians estimate the labor cost in dollars of each possible assignment and that information is summarized in the table. What is the LP constraint associated with Project 1?

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

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

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

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

The Pointy-haired boss has five projects to assign and decides to go against all convention and assign them to individuals rather than project teams.He has the Elbonians estimate the labor cost in dollars of each possible assignment and that information is summarized in the table.Use Solver to determine which of these assignments is correct.