Ginchev Ivan () (Department of MathematicsVarna, Bulgaria) Guerraggio Angelo () (Department of Economics, University of Insubria, Italy) Rocca Matteo () (Department of Economics, University of Insubria, Italy)
Abstract
In this paper we consider the vector optimization problem minC f(x), g(x) 2 -K, where f : Rn ! Rm and g : Rn Rp are C0,1 functions and C Rm and K Rp are closed convex cones. We give several notions of solutions (efficiency concepts), among them the notion of a properly efficient point (p-minimizer) of order k and the notion of an isolated minimizer of order k. We show that each isolated minimizer of order k > = 1 is a p-minimizer of order k. The possible reversal of this statement in the case k = 1 is the main subject of the investigation. For this study we apply some first order necessary and sufficient conditions in terms of Dini derivatives. We show that the given optimality conditions are important to solve the posed problem, and a satisfactory solution leads to two approaches toward efficiency concepts, called respectively sense I and sense II concepts. Relations between sense I and sense II isolated minimizers and p-minimizers are obtained. In particular, we are concerned in the stability properties of the p-minimizers and the isolated minimizers. By stability, we mean that they still remain the same type of solutions under small perturbations of the problem data. We show that the p-minimizers are stable under perturbations of the cones, while the isolated minimizers are stable under perturbations both of the cones and the functions in the data set. Further, we show that the sense I concepts are stable under perturbations of the objective data, while the sense II concepts are stable under perturbations both of the objective and the constraints.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.