Abstract :
We consider the constrained vector optimization problem minC f (x), x ∈ A, where X and Y are normed
spaces, A ⊂ X0 ⊂ X are given sets, C ⊂ Y , C = Y , is a closed convex cone, and f :X0 →Y is a given
function. We recall the notion of a properly efficient point (p-minimizer) for the considered problem and
in terms of the so-called oriented distance we define also the notion of a properly efficient point of order n
(p-minimizers of order n). We show that the p-minimizers of higher order generalize the usual notion of a
properly efficient point. The main result is the characterization of the p-minimizers of higher order in terms
of “trade-offs.” In such a way we generalize the result of A.M. Geoffrion [A.M. Geoffrion, Proper efficiency
and the theory of vector maximization, J. Math. Anal. Appl. 22 (3) (1968) 618–630] in two directions,
namely for properly efficient points of higher order in infinite dimensional spaces, and for arbitrary closed
convex ordering cones.
© 2006 Elsevier Inc. All rights reserved.
Keywords :
Properly efficient points of order k , Characterization ofproperly efficient points , Vector optimization , Properly efficient points