Locating facilities by minimax relative to closest points of demand areas

This paper formulates a minimax location problem on the continuous plane where the destinations and even the facilities may be represented by areas instead of points. What is new is that the distance function measures shortest distance between any point on the facility and any point in the demand area. General properties of the model are discussed, and specialized results are obtained for rectangular distances.