Sufficient optimality condition for vector optimization problems under D.C. data

DOI10.1023/B:JOGO.0000006715.69153.8bzbMath1061.90098MaRDI QIDQ1424961

Abdelmoutalib Metrane, Nazih Abderrazzak Gadhi

Publication date: 15 March 2004

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jogo.0000006715.69153.8b

zbMATH Keywords

Optimality condition; D.C. mapping; Subdifferential; Convex mapping; Diff-Max mapping; Local weak minimal solution

Mathematics Subject Classification ID

90C29: Multi-objective and goal programming

90C46: Optimality conditions and duality in mathematical programming

Related Items

On the optimality conditions for D.C. vector optimization problems, Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality, Optimality conditions for vector optimization problems with difference of convex maps, Characterizing strict efficiency for convex multiobjective programming problems, Optimality conditions for minimizing the difference of nonconvex vector-valued mappings, Optimality conditions for D.C. vector optimization problems under reverse convex constraints, Optimality conditions for the difference of convex set-valued mappings, Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints, Subdifferential and optimality conditions for the difference of set-valued mappings, A note on the paper ``Optimality conditions for vector optimization problems with difference of convex maps, Strict vector variational inequalities and strict Pareto efficiency in nonconvex vector optimization