1 The Problem The Guinness Brewery Company has two breweries (Dublin-B and Kilarny) and three markets (Dublin-M. Galway, and Cork). They have three warehouse locations (Kilgore, Sligo, and Galway), bait don't necessarily have to use all of them. They have transportation costs (dollars/case) for moving care of beer from brewery to warehouse, and from warehouse to market (see the table below). Note that it is possible to transport cases directly from the brewery to the market in Dublin (Dublin-B to Dublin-M). Otherwise, the cases must visit a warehouse before being transported to a market. If they use a warehouse, each one has a monthly operating cost, as well as a maximum capacity. Each brewery has a monthly supply, and each market lus a monthly demand shown below. Kilgore (W) Sligo (W) Galway (W) Dublin-B (B) Transportation Costs DublinB (B) Kilarny (B) Dublin-M (M) Galway (M) Cork (M) 15 10 16 12 11 20 25 21 9 29 15 20 16 5 12 18 Market Demand Brewery Supply Dublin-M 600 Dublin B 700 500 Klarny Galway 800 Cork 300 They want to meet all demand at minimum cost. Warehouse Cost Capacity kilore 2200 100 Sligo 450 800 Galway 320 600 1 Part 1: Concrete and Abstract Models Draw a model of the network b. Write a concrete model to solve the Guiness fixed-charge transportation problem. Hint: Begin with a standard minimam-cost network flow model with the warehouses, then modify the model as needed to accomodate the warehouse cost, capacities, and logical constraints e Convert the concrete model to abstract form d. Submit the network diagram and both models (either online or in )