On Approximate Solutions in Vector Optimization Problems Via Scalarization |
| |
Authors: | César Gutiérrez Bienvenido Jiménez Vicente Novo |
| |
Institution: | (1) Departamento de Matem′tica Aplicada, E.T.S.I. Inform′tica, Universidad de Valla-dolid, Edificio de Tecnologías de la Información y las Telecomunicaciones, Campus Miguel Delibes, s/n, 47011 Valladolid, Spain;(2) Departamento de Matemática Aplicada, E.T.S.I. Industriales, UNED, Ciudad Universitaria, c/ Juan del Rosal, 12, 28040 Madrid, Spain |
| |
Abstract: | This work deals with approximate solutions in vector optimization problems. These solutions frequently appear when an iterative
algorithm is used to solve a vector optimization problem. We consider a concept of approximate efficiency introduced by Kutateladze
and widely used in the literature to study this kind of solutions. Necessary and sufficient conditions for Kutateladze’s approximate
solutions are given through scalarization, in such a way that these points are approximate solutions for a scalar optimization
problem. Necessary conditions are obtained by using gauge functionals while monotone functionals are considered to attain
sufficient conditions. Two properties are then introduced to describe the idea of parametric representation of the approximate
efficient set. Finally, through scalarization, characterizations and parametric representations for the set of approximate
solutions in convex and nonconvex vector optimization problems are proved and the obtained results are applied to Pareto problems.
AMS Classification:90C29, 49M37
This research was partially supported by Ministerio de Ciencia y Tecnología (Spain), project BFM2003-02194. |
| |
Keywords: | ε -efficiency approximate solution monotone functional gauge functional parametric representation |
本文献已被 SpringerLink 等数据库收录! |
|