The Strictly Efficient Subgradient of Set-Valued Optimisation

DOI10.1017/S0004972700039290zbMath1154.90592OpenAlexW2035804289MaRDI QIDQ5297699

Tai Yong Li, Yi-hong Xu

Publication date: 12 July 2007

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972700039290

Mathematics Subject Classification ID

Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Generalized Lagrangian duality in set-valued vector optimization via abstract subdifferential ⋮ \(\varepsilon\)-strict subdifferentials of set-valued maps and optimality conditions ⋮ Unnamed Item ⋮ Optimality conditions for strictly efficient solutions in set-valued optimization

Cites Work

• Existence and Lagrangian duality for maximization of set-valued functions
• Optimization of set-valued functions
• Connectedness of efficient solution sets for set-valued maps in normed spaces
• Subdifferentials of multifunctions and Lagrange multipliers for multiobjective optimization.
• New generalized convexity notion for set-valued maps and application to vector optimization
• Sensitivity analysis in vector optimization
• Strong efficiency in a locally convex space

This page was built for publication: The Strictly Efficient Subgradient of Set-Valued Optimisation