RVW (Restored Volkswagens) buys 15 used VW's at each of two car auctions each week held...

Transcribed Image Text:

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. (10 points) Repair Shops S1 Used Car Lots S2 L1 L2 L3 Auction 1 550 500 Auction 2 600 450 SS S1 250 300 500 S2 350 650 450 b. Formulate this problem as a linear programming model. (15 points) (Note: You do not need to solve the model.) 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. (10 points) Repair Shops S1 Used Car Lots S2 L1 L2 L3 Auction 1 550 500 Auction 2 600 450 SS S1 250 300 500 S2 350 650 450 b. Formulate this problem as a linear programming model. (15 points) (Note: You do not need to solve the model.)