Duality theorems for a nonconvex set-valued optimization problem

DOI10.3969/J.ISSN.1005-3085.2017.02.008MaRDI QIDQ3131164zbMATH OpenFDO

Authors Guolin Yu, Xiao-Jun Ma

Publication date 29 January 2018

Full work available at URL https://doi.org/10.3969/J.ISSN.1005-3085.2017.02.008

zbMATH Keywords

convex analysisdualityoptimality conditionsset-valued optimizationapproximating multifunction

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7108324
• scientific article; zbMATH DE number 2159410
• Duality theorems of a nonconvex program with infinite constraints
• Strong duality with strict efficiency in vector optimization involving nonconvex set-valued maps
• Invex multifunctions and duality

Cited in

(6)

• Strong duality with strict efficiency in vector optimization involving nonconvex set-valued maps
• scientific article; zbMATH DE number 7351420 (Why is no real title available?)
• Existence and Lagrangian duality for maximization of set-valued functions
• Duality theorems of a nonconvex program with infinite constraints
• scientific article; zbMATH DE number 5370877 (Why is no real title available?)
• scientific article; zbMATH DE number 5238560 (Why is no real title available?)

This page was built for publication: Duality theorems for a nonconvex set-valued optimization problem

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