Optimality and duality for vector optimization problem with non-convex feasible set

DOI10.1007/s12597-019-00401-3OpenAlexW2964842607MaRDI QIDQ2307976

Surjeet Kaur Suneja, Priyanka Yadav, Sunila Sharma

Publication date: 25 March 2020

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-019-00401-3

zbMATH Keywords

vector optimizationdualityconeslevel setsKKT conditions

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
• On representations of the feasible set in convex optimization
• Pareto optimality, game theory and equilibria
• Multicriteria optimization in engineering and in the sciences
• Multiobjective symmetric duality involving cones
• Optimality conditions in convex optimization revisited
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• A survey of recent developments in multiobjective optimization
• Generalised convexity and duality in multiple objective programming
• Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
• Multicriteria Optimization
• Nonlinear Programming

This page was built for publication: Optimality and duality for vector optimization problem with non-convex feasible set