Geometrical description of the weakly efficient solution set for multicriteria location problems

Multicriteria location problems have attracted much attention in the last years within the field of Location Analysis. The central task in their analysis relies on the description of the whole set of non-dominated solutions with respect to the different criteria. Solutions to this problem in particular situations are known. In this paper we characterize the solution set of the general convex multicriteria location problem in two dimensional spaces. These tools allow us to describe in the same way the solution set of several classical location models as well as many other new problems for which no previous solution was known.