Dual conditions characterizing optimality for convex multi-objective programs.

DOI10.1007/s10107980013azbMath1050.90545OpenAlexW90601795MaRDI QIDQ1572668

N. Delaunay

Publication date: 21 July 2000

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

convex programmingmultiobjective optimizationPareto minimum\(\varepsilon\)-subdifferentials

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29) Nonsmooth analysis (49J52)

Related Items (9)

Optimality conditions for nondifferentiable multiobjective semi-infinite programming problems ⋮ Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential ⋮ Optimality theorems for convex semidefinite vector optimization problems ⋮ On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data ⋮ Multiobjective DC programs with infinite convex constraints ⋮ Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs ⋮ Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions ⋮ Characterizations of solution sets of convex vector minimization problems ⋮ Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems

This page was built for publication: Dual conditions characterizing optimality for convex multi-objective programs.