Technical Note—Extension of the Elzinga-Hearn Algorithm to the Weighted Case

The problem considered in this note is that of locating a single new facility among m existing facilities with the objective of minimizing the maximum weighted Euclidean distance of the new facility from the existing facilities, without making the assumption that all the weights are equal. The new algorithm takes into consideration the structure of the problem, and it will terminate in a finite number of iterations if exact arithmetic is used.