Approximate solutions of multiobjective optimization problems

• Autores: César Gutiérrez Vaquero , Lidia Huerga Pastor
• Localización: BEIO, Boletín de Estadística e Investigación Operativa, ISSN 1889-3805, Vol. 30, Nº. 1, 2014, págs. 30-48
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • This paper collects some recently published results on approximate solutions of infinite dimensional vector optimization problems. Here, they are obtained in a finite dimensional framework with simple formulations and proofs, in order to get a self-contained and illustrative work. To be exact, a concept of approximate nondominated solution is presented, and its main properties are studied. After that, a general scalarization scheme is introduced to characterize this kind of solutions via suboptimal solutions of associated scalar optimization problems. Finally, a Kuhn-Tucker multiplier rule is stated in convex problems ordered by components, that characterizes the more popular type of å-efficient solution of the literature