Generalized properly efficient solutions of vector optimization problems

DOI10.1007/S001860100112zbMath1031.90039OpenAlexW2006688713MaRDI QIDQ1396966

D. Massart

Publication date: 15 July 2003

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001860100112

zbMATH Keywords

necessary optimality conditionssubgradienttangent conevector optimization problemproper efficiency

Mathematics Subject Classification ID

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

Related Items (4)

Necessary optimality conditions in terms of convexificators in Lipschitz optimization ⋮ Optimality criteria and duality in multiobjective programming involving nonsmooth invex functions ⋮ Efficient Multi-objective Reinforcement Learning via Multiple-gradient Descent with Iteratively Discovered Weight-Vector Sets ⋮ Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization

This page was built for publication: Generalized properly efficient solutions of vector optimization problems