Exam 10: Distribution and Network Models

Explain how the general linear programming model of the assignment problem can be modified to handle problems involving a maximization function,unacceptable assignments,and supply not equally demand.

A dummy origin in a transportation problem is used when supply exceeds demand.

RVW (Restored Volkswagens)buys 15 used VW's at each of two car auctions each week held at different locations.It then transports the cars to repair shops it contracts with.When they are restored to RVW's specifications,RVW sells 10 each to three different used car lots.There are various costs associated with the average purchase and transportation prices from each auction to each repair shop.Also there are transportation costs from the repair shops to the used car lots.RVW is concerned with minimizing its total cost given the costs in the table below. a.Given the costs below, draw a network representation for this problem. Repair Shops 1 2 Auction1 550 500 Auction2 600 450 Used Car Lots L1 L2 L3 S1 250 300 500 S2 350 650 450 b.Formulate this problem as a transshipment linear programming model.

How is the shortest-route problem like the transshipment problem?

Consider the network below.Formulate the LP for finding the shortest-route path from node 1 to node 7.

The network below shows the flows possible between pairs of six locations.Formulate an LP to find the maximal flow possible from Node 1 to Node 6.

When a route in a transportation problem is unacceptable,the corresponding variable can be removed from the LP formulation.