Optimality and mixed duality in multiobjective \(E\)-convex programming
From MaRDI portal
Publication:262686
DOI10.1186/S13660-015-0854-6zbMath1332.90252OpenAlexW2181947535WikidataQ59428150 ScholiaQ59428150MaRDI QIDQ262686
Do Sang Kim, Liguo Jiao, Guang-Ri Piao
Publication date: 30 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0854-6
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Nonlinear programming (90C30)
Related Items (5)
\(V-E\)-invexity in \(E\)-differentiable multiobjective programming ⋮ Unnamed Item ⋮ Mixed \(E\)-duality for \(E\)-differentiable vector optimization problems under (generalized) \(V\)-\(E\)-invexity ⋮ Optimality conditions for \(E\)-differentiable vector optimization problems with the multiple interval-valued objective function ⋮ Optimality and duality with respect to \(b\)-\((\mathcal{E},m)\)-convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimality criteria in nonlinear programming involving nonconvex functions
- Some properties of \(E\)-convex functions
- On sufficiency of the Kuhn-Tucker conditions
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Some properties of semi-\(E\)-convex functions.
- Optimality criteria in \(E\)-convex programming
- On the \(E\)-epigraph of an \(E\)-convex function
- Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
- Convex Transformable Programming Problems and Invexity
- On \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- On mixed duality in mathematical programming.
This page was built for publication: Optimality and mixed duality in multiobjective \(E\)-convex programming