A Maximin Location Problem with Maximum Distance Constraints

This paper deal with the problem where a facility must be placed among n points so that the shortest weighted distance to a point is as large as possible. At the same time the facility must be within a pre-specified distance from each point; the facility is to be located on a plane and Euclidean distances are used. Applications include the location of facilities that are obnoxious in the sense that they should be placed as far away from certain points as possible but still be within a pre-specified “reach” of these points.