Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization

DOI10.1007/s12597-012-0092-3zbMath1353.90140OpenAlexW1966077981MaRDI QIDQ505143

Bhawna Kohli, Surjeet Kaur Suneja

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0092-3

zbMATH Keywords

vector optimizationconvexifactorsgeneralized nonsmooth cone convexityoptimality and duality

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Related Items (4)

Optimality conditions and duality for interval-valued optimization problems using convexifactors ⋮ Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem ⋮ Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem ⋮ Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints

Cites Work

• Unnamed Item
• Convexifactors, generalized convexity, and optimality conditions
• Theory of multiobjective optimization
• Proper efficiency with respect to cones
• Perfect duality for convexlike programs
• Nonsmooth calculus, minimality, and monotonicity of convexificators
• Hunting for a smaller convex subdifferential
• Arcwise connected cone-convex functions and mathematical programming
• Generalized connected functions with respect to cones
• Symmetric duality in multiobjective programming involving generalized cone-invex functions
• Necessary optimality conditions in terms of convexificators in Lipschitz optimization
• Generalized nonsmooth invexity over cones in vector optimization
• Arcwise cone connected functions and optimality.
• Saddle-point type optimality criteria for optimization problem over cones.
• Recent Developments in Vector Optimization
• Convexlike alternative theorems and mathematical programming
• A class of nonconvex functions and mathematical programming
• Weak minimization and duality
• Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
• Scalarization and lagrange duality in multiobjective optimization
• Convexifactors, generalized convexity and vector optimization
• Some new classes of generalized concave vector-valued functions
• Vector optimization for a class of nonconvex functions

This page was built for publication: Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization