A Mini-Max Location Problem with Demand Points Arbitrarily Distributed in a Compact Connected Space

Consider a finite set of demand points which exist anywhere on the boundary of a rectangle contained in the two-dimensional Euclidean space. This paper considers the problem of finding an optimal location (on the boundary of the rectangle) which minimizes the maximum average Euclidean distance to the demand points. The method presented is independent of the number of demand points.