MULTICRITERIA PLANAR LOCATION-PROBLEMS

Given Q different objective functions, three types of single-facility problems are considered: lexicographic, Pareto and max ordering proble ms. After discussing the interrelation between the problem types, a co mplete characterization of lexicographic locations and some instances of Pareto and max ordering locations is given. The characterizations r esult in efficient solution algorithms for finding these locations. Th e paper relies heavily on the theory of restricted locations developed by the same authors, and can be further extended, for instance, to mu lti-facility problems with several objectives. The proposed approach i s more general than previously published results on multicriteria plan ar location problems and is particularly suited for modelling real-wor ld problems.