Characterization of efficient solutions of multi-objective \(E\)-convex programming problems

DOI10.1016/S0096-3003(03)00526-5zbMath1056.90127MaRDI QIDQ1827020

Yanyan Li

Publication date: 6 August 2004

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

zbMATH Keywords

duality gap\(E\)-convex programmingmulti-objective programming problems

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (8)

Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function ⋮ Optimality of \(E\)-pseudoconvex multi-objective programming problems without constraint qualifications ⋮ On the exactness and the convergence of the \(l_1\) exact penalty \(E\)-function method for \(E\)-differentiable optimization problems ⋮ Unnamed Item ⋮ Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function ⋮ Generalization of some important theorems to E-midconvex functions ⋮ Second order \((F,\alpha ,\rho ,d,E)\)-convex function and the duality problem ⋮ (F, K, b)-vex sets and some related properties

Cites Work

• Unnamed Item
• Convex composite multi-objective nonsmooth programming
• On sufficiency of the Kuhn-Tucker conditions
• Necessary conditions for nonlinear suboptimization over the weakly- efficient set
• Six kinds of roughly convex functions
• \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
• Optimality criteria in \(E\)-convex programming
• Convex Transformable Programming Problems and Invexity

This page was built for publication: Characterization of efficient solutions of multi-objective \(E\)-convex programming problems