Epsilon Solutions and Duality in Vector Optimization

Valyi, I. (1987). Epsilon Solutions and Duality in Vector Optimization. In: Toward Interactive and Intelligent Decision Support Systems. Eds. Sawaragi, Y., Inoue, K., & Nakayama, H., pp. 417-426 Germany: Springer Berlin Heidelberg. ISBN 978-3-642-46607-6 10.1007/978-3-642-46607-6_45.

Full text not available from this repository.


The study of epsilon solutions in vector optimization problems was started in 1979 by S. S. Kutateladze [1]. These types of solutions are interesting because of their relation to non-differentiable optimization and the vector valued extensions of Ekeland’s variational principle as considered by P. Loridan [2] and I. Vályi [3], but computational aspects are perhaps even more important. In practical situations, namely, we often stop the calculations at values that we consider sufficiently close to the optimal solution, or use algorithms that result in some approximates of the Pareto set. Such procedures can result in epsilon solutions that are under study in this paper. A paper by D. J. White [4] deals with this issue and investigates how well these solutions approximate the exact solutions.

Item Type: Book Section
Research Programs: System and Decision Sciences - Core (SDS)
Depositing User: Romeo Molina
Date Deposited: 14 Dec 2016 08:45
Last Modified: 27 Aug 2021 17:28
URI: https://pure.iiasa.ac.at/14142

Actions (login required)

View Item View Item