Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
type: Item
instance of: scholarly article
title: Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
zbMATH Open document ID: 1056.90127
DOI: 10.1016/S0096-3003(03)00526-5
author: Yanyan Li
published in: Applied Mathematics and Computation
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 2082088
zbMATH Keywords: \(E\)-convex programming
zbMATH Keywords: duality gap
zbMATH Keywords: multi-objective programming problems
MaRDI profile type: Publication
cites work: \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
cites work: Optimality criteria in \(E\)-convex programming
cites work: Six kinds of roughly convex functions
cites work: Convex Transformable Programming Problems and Invexity
cites work: On sufficiency of the Kuhn-Tucker conditions
cites work: Necessary conditions for nonlinear suboptimization over the weakly- efficient set
cites work: Q3760254
cites work: Convex composite multi-objective nonsmooth programming
description: scientific article; zbMATH DE number 2082088