M. Rodríguez Álvarez, M. Á. GobernaTorrent, V. N. Vera de Serio
Given a semi-infinite multiobjective convex problem we introduce a data qualification that enables to characterize optimality in terms of Lagrange multipliers. We show that this condition characterizes the weak efficient solutions through the weak Karush-Kuhn-Tucker (KKT) condition, and identifies the proper efficient solutions through the strong KKT condition. We also address the question in relation to a gap function.
Palabras clave / Keywords: multiobjective programming, convex multiobjective programming, semi-infinite programming, data qualifications, KKT condition
Programado
Sesión bilateral SEIO-APDIO: Continuous Optimization (Organizadores: Tatiana Tchemisova y Margarita Rodríguez Álvarez)
1 de junio de 2018 12:30
Sala 6