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

DOI10.1007/S12597-019-00401-3MaRDI QIDQ2307976zbMATH OpenOpenAlexFDO

Authors Surjeet Kaur Suneja, Sunila Sharma, Priyanka Yadav

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

conesdualityKKT conditionslevel setsvector optimization

Mathematics Subject Classification ID

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

Recommendations

• Optimality and duality in nonsmooth vector optimization with non-convex feasible set
• Necessary and sufficient KKT optimality conditions in non-convex multi-objective optimization problems with cone constraints
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• Optimality conditions in optimization problems with convex feasible set using convexificators
• New qualification conditions for convex optimization without convex representation

Cites work

• A survey of recent developments in multiobjective optimization
• Generalised convexity and duality in multiple objective programming
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 3856842 (Why is no real title available?)
• Multicriteria Optimization
• Multicriteria optimization in engineering and in the sciences
• Multiobjective symmetric duality involving cones
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• Nonlinear Programming
• On representations of the feasible set in convex optimization
• Optimality conditions for multiobjecttve and nonsmooth minimisation in abstract spaces
• Optimality conditions in convex optimization revisited
• Optimality conditions under relaxed quasiconvexity assumptions using star and adjusted subdifferentials
• Pareto optimality, game theory and equilibria

Cited in

(1)

• Optimality conditions and duality results for a new class of nonconvex nonsmooth vector optimization problems

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

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