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

DOI10.1023/B:JOGO.0000006715.69153.8bzbMath1061.90098OpenAlexW1986179837MaRDI 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 conditionD.C. mappingSubdifferentialConvex mappingDiff-Max mappingLocal weak minimal solution

Mathematics Subject Classification ID

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

Related Items (11)

Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Optimality conditions for the difference of convex set-valued mappings ⋮ On the optimality conditions for D.C. vector optimization problems ⋮ Subdifferential and optimality conditions for the difference of set-valued mappings ⋮ Characterizing strict efficiency for convex multiobjective programming 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 ⋮ Optimality conditions for minimizing the difference of nonconvex vector-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 ⋮ Optimality conditions for D.C. vector optimization problems under reverse convex constraints

This page was built for publication: Sufficient optimality condition for vector optimization problems under D.C. data