The envelope theorem for multiobjective convex programming via contingent derivatives
From MaRDI portal
Publication:2637941
DOI10.1016/j.jmaa.2010.06.036zbMath1225.90116MaRDI QIDQ2637941
María José Muñoz-Bouzo, Pedro Jiménez Guerra, Miguel Angel Melguizo
Publication date: 13 September 2010
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jmaa.2010.06.036
sensitivity; Lagrange multiplier; envelope theorem; tangentially regular multifunction; vector convex program
Related Items
Corrigendum to ``the envelope theorem for multiobjective convex programming via contingent derivatives [J. Math. Anal. Appl. 372 (1) (2010) 197-207], A natural extension of the classical envelope theorem in vector differential programming
Cites Work
- Unnamed Item
- Sensitivity analysis in convex programming
- Optimality conditions in multiobjective differentiable programming
- About duality and alternative in multi-objective optimization
- The saddle point theorem of Kuhn and Tucker in ordered vector spaces
- Sensitivity and optimality conditions in the multiobjective differential programming
- On the envolvent theorem in multiobjective programming
- Sensitivity analysis for convex multiobjective programming in abstract spaces
- Sensitivity analysis in multiobjective differential programming
- Set-valued analysis
- Density theorems for ideal points in vector optimization