Sets of efficient points in a normed space (Q1084331): Difference between revisions

The paper deals with efficient solutions of a multiobjective programming problem in a normed space; the objective functions to be minimized are distances to every point of a compact subset. We give a geometrical description of the sets of strictly efficient, efficient and weakly efficient points which looks like a description of the convex hull. It makes use of a family of cones, which play the role of halfspaces in the Euclidean case. Topological properties of these cones are developed. The above description leads to hull and closure properties of sets of efficiency. In addition the two-dimensional case is emphasized in connection with location theory where more precise results are obtained. In particular, when the space is strictly convex or polyhedral, the description of the sets of efficiency provides a geometrical construction of these sets.