1. Consider a hierarchical facility location model. There are three customer sites, i.e., N = (1,2,3) and 3 potential facility Ications, i.e., M = {4,5,6). Locations 4 and 6 are candidates for a type I facility, whereas locations 5 and 6 are candidates for a type Il facility, i.e., MI = {4, 6) and MII = (5,6). We would like to open one facility for each type, i.e., p1 = P2 = 1. The number of customers at sites 1, 2, 3 for service types I and II are 500 (site 1, type 1), 2000 (site 1, type II), 400 (site 2, type 1), 200 (site 2, type II), 750 (site 3, type 1) and 1000 (site 3, type II) respectively. We would like to decide which sites of potential facilities to open condidering minimization of total distance between customers and facility sites. Below is the distance matrix between customers and potential facilities. Formulate this problem in open form. Potential Facility Locations Customers 1. Consider a hierarchical facility location model. There are three customer sites, i.e., N = (1,2,3) and 3 potential facility Ications, i.e., M = {4,5,6). Locations 4 and 6 are candidates for a type I facility, whereas locations 5 and 6 are candidates for a type Il facility, i.e., MI = {4, 6) and MII = (5,6). We would like to open one facility for each type, i.e., p1 = P2 = 1. The number of customers at sites 1, 2, 3 for service types I and II are 500 (site 1, type 1), 2000 (site 1, type II), 400 (site 2, type 1), 200 (site 2, type II), 750 (site 3, type 1) and 1000 (site 3, type II) respectively. We would like to decide which sites of potential facilities to open condidering minimization of total distance between customers and facility sites. Below is the distance matrix between customers and potential facilities. Formulate this problem in open form. Potential Facility Locations Customers