Characterizing strict efficiency for convex multiobjective programming problems
DOI10.1007/s10898-010-9543-7zbMath1271.90074OpenAlexW1974937431MaRDI QIDQ625650
Davinder Bhatia, Aparna Mehra, Anjana Gupta
Publication date: 25 February 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9543-7
multiobjective programming problemconvex subdifferentialD.C. optimizationsaddle point of higher orderstrict local efficient solution
Multi-objective and goal programming (90C29) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)
Related Items (1)
Cites Work
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Optimality conditions for D.C. vector optimization problems under reverse convex constraints
- From scalar to vector optimization.
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- A saddle-point characterization of Pareto optima
- First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
- Strict minimality conditions in nondifferentiable multiobjective programming
- Sufficient optimality condition for vector optimization problems under D.C. data
- A survey of recent developments in multiobjective optimization
- Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
- Saddle points and Pareto points in multiple objective programming
- Stability in Mathematical Programming with Nondifferentiable Data
- Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Strict efficiency in vector optimization
This page was built for publication: Characterizing strict efficiency for convex multiobjective programming problems
