Location of an undesirable facility in a polygonal region with forbidden zones

In this paper, we develop the problem of locating an undesirable facility in a bounded polygonal region (with forbidden polygonal zones), using Euclidean distances, under an objective function that generalizes the maximin and maxisum criteria, and includes other criteria such as the linear combinations of these criterions. We identify a finite dominating set (finite set of points to which an optimal solution must belong) for this problem and show that an optimum solution can be found in polynomial time in the number of vertices of the polygons in the model and the number of existing facilities.