Characterizing strict efficiency for convex multiobjective programming problems

DOI10.1007/S10898-010-9543-7MaRDI QIDQ625650zbMATH OpenOpenAlexFDO

Authors Anjana Gupta, Aparna Mehra, Davinder Bhatia

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

zbMATH Keywords

multiobjective programming problemconvex subdifferentialD.C. optimizationsaddle point of higher orderstrict local efficient solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions for solutions belonging to restricted classes (Lipschitz controls, bang-bang controls, etc.) (49K30)

Recommendations

• Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
• \(\varPhi\)-strict local efficient solution for multiobjective programming problems
• Optimality and mixed saddle point criteria in multiobjective optimization
• Study on a class of multi-objective programming under generalized convexity
• scientific article; zbMATH DE number 810379

Cites work

• A saddle-point characterization of Pareto optima
• A survey of recent developments in multiobjective optimization
• Characterizations of strict local minima and necessary conditions for weak sharp minima
• First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
• From scalar to vector optimization.
• Higher Order Efficiency, Saddle Point Optimality, and Duality for Vector Optimization Problems
• Isolated minimizers and proper efficiency for \(C^{0,1}\) constrained vector optimization problems
• Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
• Optimality conditions for D.C. vector optimization problems under reverse convex constraints
• Optimality conditions for vector optimization problems of a difference of convex mappings
• Saddle points and Pareto points in multiple objective programming
• Stability in Mathematical Programming with Nondifferentiable Data
• Strict efficiency in vector optimization
• Strict minimality conditions in nondifferentiable multiobjective programming
• Sufficient optimality condition for vector optimization problems under D.C. data

Cited in

(4)

• Isolated efficiency in nonsmooth semi-infinite multi-objective programming
• Optimality and mixed saddle point criteria in multiobjective optimization
• On characterizations of proper efficiency for nonconvex multiobjective optimization
• scientific article; zbMATH DE number 6181740 (Why is no real title available?)

This page was built for publication: Characterizing strict efficiency for convex multiobjective programming problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q625650)