The Lagrangian Process and Sensitivity in Constrained Convex Set-Valued Optimization Problems
In this talk I present a new set-valued Lagrange multiplier rule for constrained convex set-valued optimization problems. I introduce the concept of Lagrange process, a set-valued extension of the classical concept of Lagrange multiplier where the conventional notion of linear continuous operator is replaced by its set-valued analogue, the concept of closed convex process. I also report some connections of this new set-valued multiplier with the sensitivity of the program.
Palabras clave: Lagrange multiplier; convex vector optimization; process; optimality condition
Otros trabajos en la misma sesión
Últimas noticias
-
04/07/19
Programa científico completo disponible -
31/05/19
Convocado Premio INE 2019 -
13/04/19
Inscripción ya abierta