The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives

DOI10.1007/978-3-642-21114-0_12zbMath1247.90235OpenAlexW199796592MaRDI QIDQ2905374

Trúóng Xuân Dúc Hā

Publication date: 27 August 2012

Published in: Vector Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21114-0_12

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (6)

Sufficient conditions for global weak Pareto solutions in multiobjective optimization ⋮ Higher-order set-valued Hadamard directional derivatives: calculus rules and sensitivity analysis of equilibrium problems and generalized equations ⋮ Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming ⋮ Unnamed Item ⋮ Characterization of properly optimal elements with variable ordering structures ⋮ On Lagrange Multiplier Rules for Set-Valued Optimization Problems in the Sense of Set Criterion

This page was built for publication: The Fermat Rule and Lagrange Multiplier Rule for Various Efficient Solutions of Set-Valued Optimization Problems Expressed in Terms of Coderivatives