Exercise 1 - Total Covering Problem Consider the problem of location with the following statements: . A number of demand points (villages), indexed by i(i=1...) . : number of eligible sites to locate TV transmitters, indexed by G=1.... ) 2.0): covering zone (set of points able to be covered with the point i). Note that we don't use here a Covering Distance D. to determine the covering zones, because distances become weak factors behind the presence of mountains separating the different villages. Indeed, mountain cut signal transmission impossible flow). . : opening cost of site=1... ). The following graph shows villages (blank squares) and possible sites for location of TV transmitters (black squares). The numbers between parenthesis are the costs of TV transmitter construction in millions of dollars estimated according to the selected site features. The ellipses ( installed) crossing transmitters indicate their ranges (ie covered area if transmitter We want to choose the transmitters to be constructed in order to cover the all villages with the minimal cost. Note that here, and R5 a) What is the name of this logistics optimization problem? (answer among: Single facility location. Total covering problem, Maximal covering problem, p-center location problem, p- median...) b) What is the Covering Matrix A = (a) = (?) c) Note that site opening cost vector (C) - (10, 8, 6, 5, 7) in MS. Formulate with a 0-1 Linear Programming this problem. Exercise 1 - Total Covering Problem Consider the problem of location with the following statements: . A number of demand points (villages), indexed by i(i=1...) . : number of eligible sites to locate TV transmitters, indexed by G=1.... ) 2.0): covering zone (set of points able to be covered with the point i). Note that we don't use here a Covering Distance D. to determine the covering zones, because distances become weak factors behind the presence of mountains separating the different villages. Indeed, mountain cut signal transmission impossible flow). . : opening cost of site=1... ). The following graph shows villages (blank squares) and possible sites for location of TV transmitters (black squares). The numbers between parenthesis are the costs of TV transmitter construction in millions of dollars estimated according to the selected site features. The ellipses ( installed) crossing transmitters indicate their ranges (ie covered area if transmitter We want to choose the transmitters to be constructed in order to cover the all villages with the minimal cost. Note that here, and R5 a) What is the name of this logistics optimization problem? (answer among: Single facility location. Total covering problem, Maximal covering problem, p-center location problem, p- median...) b) What is the Covering Matrix A = (a) = (?) c) Note that site opening cost vector (C) - (10, 8, 6, 5, 7) in MS. Formulate with a 0-1 Linear Programming this