Exam 4: Network Models

In a given transportation problem involving cost minimization, there are three sources, with outputs of 10, 18, and 17, respectively.There are four destinations, with demands of 14, 11 9 and 6, respectively.

A bi-directional arc in a shortest path problem can be modeled as two unidirectional arcs.

In a shortest path model:

Which of the following is true about an intermediate node in a transshipment problem?

Consider the problem faced by SnowDevil in problem 1.Suppose the next week Tahoe can produce only 15 units.

Two nodes are said to be connected if what exists?

Which of the following is not an algorithm for solving the assignment model?

In a minimal spanning tree problem:

Network connectivity models solve what type of problem?

Which of the following cannot model a blocked route on a transportation model?

Consider the DOD blast area represented by the network for problem 5.The DOD would like to eliminate the need for 4-wheel drive vehicles and is considering paving some of the paths between sites.Paving a path will cost taxpayers about $125,000 per mile.

The optimal solution to an assignment model can be obtained by solving the problem as each of the following models except:

The optimal total shipping cost in a minimization transportation model is $622, and the reduced cost from source node 1 to destination node 6 is $6.This implies that if one were to deviate from the optimal solution by shipping one unit from node 1 to node 6, the new minimum total shipping cost would be $628.

A B-1 bomber must fly through a choice of "safe areas," deliver its bombing payload, and return to its home base using minimum fuel.Which network model would be the most appropriate representation?