Single facility location problem with weighted minimax Euclidean distance

This paper presents a technique to solve ‘weighted minimax single facility location problems’ with Euclidean distance. The objective is to minimize the maximum weighted distance between any customer and the new facility. A graphical method suggested here, is based on the basic theory of vector algebra. Product of ‘weights’ of customers and distances between them are treated as force vectors. Every customer is considered as a point of emergence for a vector directed towards an optimum location with respect to its position. The methodology presented here ensures the optimum solution.