We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
( $$\epsilon $$ -)Efficiency in difference vector optimization.
- Authors
El Maghri, Mounir
- Abstract
The paper deals with the problem of characterizing Pareto optima (efficient solutions) for the difference of two mappings vector-valued in a finite or infinite-dimensional preordered space. Closely related to the well-known optimality criterion of scalar DC optimization, a mixed vectorial condition is obtained in terms of both strong (Fenchel) and weak (Pareto) $$\epsilon $$ -subdifferentials that completely characterizes the exact or approximate weak efficiency. This condition also allows to deal with some special restricted mappings. Moreover, the condition established in the literature in terms of strong $$\epsilon $$ -subdifferentials for characterizing the strongly efficient solutions (usual optima), is shown here to remain valid without assuming that the objective space is order-complete.
- Subjects
PARETO optimum; VECTORS in N-dimensions; MATHEMATICAL optimization; PARETO principle; CARTOGRAPHY software
- Publication
Journal of Global Optimization, 2015, Vol 61, Issue 4, p803
- ISSN
0925-5001
- Publication type
Article
- DOI
10.1007/s10898-014-0204-0