Optimality of \(E\)-pseudoconvex multi-objective programming problems without constraint qualifications
From MaRDI portal
Publication:1926608
DOI10.1007/s11590-011-0350-yzbMath1281.90052OpenAlexW2039056629MaRDI QIDQ1926608
Guolin Yu, Yan Jiang, Yangyang Lu
Publication date: 28 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0350-y
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some properties of \(E\)-convex functions
- Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity
- Generalizations of \(E\)-convex and B-vex functions
- Nonlinear programming with \(E\)-preinvex and local \(E\)-preinvex functions
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- Some properties of semi-\(E\)-convex functions.
- Optimality criteria in \(E\)-convex programming
- Advances in multicriteria analysis
- On the \(E\)-epigraph of an \(E\)-convex function
- A survey of recent developments in multiobjective optimization
- Handbook of multicriteria analysis
- Quasi and strictly quasiE-convex functions
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming