Answer Happy

Pizza Delivery You are in charge of selecting a set of locations for a new pizza delivery service in Knoxville. You have one possible location in each of 12 Knoxville neighborhoods (labeled A-L). Each of the 12 neighborhoods represents a single yes/no decision for you, representing whether or not you choose that location. Your goal is to determine the minimum number of locations that enable you to serve all neighborhoods in strictly less than 10 minutes. Below you see a matrix of the travel times between all 12 neighborhoods (note that the travel time from a given neighborhood to itself is just 1 minute). For example, if you choose to open a location in neighborhood J, you can reach neighborhoods F, H, and J in under 10 minutes, but you cannot reach the other neighborhoods in under 10 minutes (see column Lorrow 38. Times from J to F, H, and I are highlighted in red). 0 1 2 3 1 5 5 7 3 9 Hint: You will need to create a separate matrix of indicators, based on the travel times matrix, which will represent whether or not each travel time is below the 10-minute goal. Part a) (10pts) - Develop and solve a model to determine minimum number of locations for your pizza delivery service. Part b) (5 pts) - Create a copy of this tab and label it "Pizza - Part B". Now suppose that there are some constraints in opening locations. Specifically, a location in C cannot be opened if location in C is opened but in lis closed. Pay attention that A can be opened if both Cand I are opened, or both are closed, or His closed and Kis opened; splitting the condition in two constraints will not work. Insert this new constraint into your model. How does the solution change? 1 2 3 1 5 5 7 8 A B 40 To Neighborhood Travel Times From Neighborhood A B с D E F G G H 1 JK к L A 1 8 11 22 17 9 19 19 22 25 33 B 8 1 13 25 26 14 B 8 11 34 23 20 32 33 C 11 13 1 12 14 17 21 15 24 16 24 1 30 D 22 25 121 12 13 12 18 27 11 11 21 E E 17 26 14 12 1 16 17 27 25 15 9 9 1 9 9 F 9 14 16 13 16 1 9 18 16 6 14 21 9 G G 23 11 21 7 17 22 1 9 12 12 24 24 H 19 24 15 18 27 19 9 1 9 6 18 22 9 9 6 I 1 22 23 16 27 25 16 12 9 1 14 45 12 J5 20 16 19 15 6 12 6 14 1 12 14 K7 32 24 11 9 14 24 18 19 12 1 7 L 7 L 7 8 30 219 21 24 22 12 34 7 1 7 7 1 9 9 6 1 2 8 1