Consider the following integer-linear program which is used to decide which warehouses to open from a set of potential warehouses, and how to assign m retail stores to the opened warehouses (for receiving supplies). Note that each retail store must be assigned to exactly one warehouse. Each warehouse can serve all the retail stores. Associ ated with each assignment is a transportation cost c... and associated with opening cach warehouse is a fixed cost f. 1. We seek to minimize the total cost. This is known as a location-allocation model Let 1. if store is assigned to warehouse. if warehouse i is opened. a. a Then, the location-allocation model is SL 10. 11. 1.... (3) Assume that 4, 5, and that the fixed cost for opening a warehouse is $20,000 for each of four warthouses The transportation costs for all pairs of warehouses and stores (in thousands) are provided in the table below: Stores 12345 110 15 20 940 2 12 17 15 20 10 3 18 14 10 35 16 49 12 33 28 19 Questions and 1. For the solution [1.1.1.1] which represents that all warehouses are open, compute the seal cost describe how you did so. Note that the notation for solutions that we will use uses a 1 to indicate that the corresponding warehouse is open and 0 otherwise (eg, the solution 10, 1.0.11 mean that warehouses 2 and 4 are open, etc.). 2. Run Tabu Search for five iterations with e-2, and starting from the solution [1,1,1,1]. A neighborhood here is defined as a solution in which the status of only one warehouse is flipped, ie, you can flip one warehouse from being open to being closed or vice versa to generate a neighbor (except if that warehouse is on the Tabulis If a warehouse is flipped from open to closed or vice versa, that warehouse should go on the Tabu list starting from the next iteration. Use greedy selection for neighbors. Show detailed work for every iteration, then at the end of the algorithm, report the best solution found. 3. Run Simulated Annealing for five iterations with 0.4, V20 and 2 starting from [1.1.1.1). Use the same neighborhood definition as above, and greedy selection for the neighbors Show detailed work for every iteration, then at the end of the algorithm, report the best solution found. For this part, use the following random numbers for accept reject decisions (use them in this ceder): 0.5683, 0.3459, 0.6412.0.534700281 Use the first number in this list for the first comparison you have with regardless of what iteration it happens to be), ie, if the first comparison you do is in iteration 5, then you should use the first random number in this list.