Consider the following integer-linear program which is used to decide which warehouses to open from a set of n 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 Cij, i = 1,...,n, j = 1,..., m, and associated with opening each warehouse is a fixed cost fi, i = 1,..., n. We seek to minimize the total cost. This is known as a location-allocation model. Let and Xij = 1, 10, if store j is assigned to warehouse i, o/w, Yi = 1, if warehouse i is opened, o/w, 10, Then, the location-allocation model is: s.t. n m 11 = CijXij + fiyi i=1 j=1 i=1 min z = n . xj = 1, Xij i=1 m Xij myi i= 1,...,n, j = 1,...,m, j=1 Xij {0, 1}, i = 1,...,n, j = 1,...,m, y; (0, 1), i = 1,..., n. 1 2 3 4 i = 1,..., n. Stores j = 1,...,m, Assume that n = 4, m = 5, and that the fixed cost for opening a warehouse is $20,000 for each of four warehouses. The transportation costs for all pairs of warehouses and stores (in thousands) are provided in the table below: 1 2 4 5 3 15 20 10 9 40 12 17 15 20 10 18 14 10 35 16 9 12 33 28 19 i = 1,...,n, (1) Questions: 1. For the solution [1, 1, 1, 1] which represents that all warehouses are open, compute the total cost, z(x, y) and 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 (e.g., the solution [0, 1, 0, 1] means that warehouses 2 and 4 are open, etc.). 2. Run Tabu Search for five iterations with 7 = 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, i.e., 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 Tabu list). 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 r; = 0.4, Vi 0 and t = 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 order!): 0.5683, 0.3459, 0.6412, 0.5347, 0.0281. Use the first number in this list for the first comparison you have with e (regardless of what iteration it happens to be), i.e., if the first comparison you do is in iteration 5, then you should use the first random number in this list.