Dual conditions characterizing optimality for convex multi-objective programs.

DOI10.1007/S10107980013AMaRDI QIDQ1572668zbMATH OpenOpenAlexFDO

Authors N. Delaunay, B. M. Glover, V. Jeyakumar, A. M. Rubinov

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

\(\varepsilon\)-subdifferentialsconvex programmingmultiobjective optimizationPareto minimum

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 3876940
• scientific article; zbMATH DE number 4119966
• Necessary and sufficient conditions for efficiency via convexificators
• Duality theorem of nondifferentiable convex multiobjective programming
• Optimality conditions in differentiable multiobjective programming

Cited in

(13)

• Optimality conditions for nondifferentiable multiobjective semi-infinite programming problems
• Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
• Necessary and sufficient conditions for (weakly) efficient of non-differentiable multi-objective semi-infinite programming problems
• Multiobjective DC programs with infinite convex constraints
• Characterizations of solution sets of convex vector minimization problems
• On optimality necessary conditions and the duality of a -convex multi-objective programming
• scientific article; zbMATH DE number 3876940 (Why is no real title available?)
• Optimality theorems for convex semidefinite vector optimization problems
• scientific article; zbMATH DE number 4119966 (Why is no real title available?)
• On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data
• ``Near weighted utilitarian characterizations of Pareto optima
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions

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

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