On Pareto optima, the Fermat-Weber problem, and polyhedral gauges (Q918867)

This paper deals with problems of scalarization in vector optimization, in the framework of location theory with respect to objective functions involving polyhedral gauges. A nice concept (namely, the so-called diff- max property) is developed and used to prove that each Pareto optimum is properly efficient (in other words, each Pareto optimum is the solution to a Fermat-Weber problem, with strictly positive coefficients). This concept is also used to characterize polyhedral gauges. Finally, practical rules are given in order to obtain the whole set of efficient points of a location problem involving polyhedral gauges. However, an efficient implementation of the described procedure does not seem very easy.