Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems
From MaRDI portal
Publication:2405783
DOI10.1186/s13660-015-0675-7zbMath1395.90221OpenAlexW2157019285WikidataQ59431830 ScholiaQ59431830MaRDI QIDQ2405783
Publication date: 26 September 2017
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-015-0675-7
optimal solutionsproperly efficient solutionsmulti-objective problems\(E\text{-}[0,1\) convex functions]
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Norm-based approximation in \(E\)-\([0,1\) convex multi-objective programming]
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Roughly \(B\)-invex programming problems
- Generalized convexity and vector optimization.
- Optimality criteria in nonlinear programming involving nonconvex functions
- Invexity and optimization
- Characterization of efficient solutions for multi-objective optimization problems involving semi-strong and generalized semi-strong \(E\)-convexity
- Proceedings of the 5th international workshop on generalized convexity held at Janus Pannonius University, Pécs, Hungary, August 31-September 2, 1992
- Generalised convexity and duality in multiple objective programming
- Generalization of some duality theorems in nonlinear programming
This page was built for publication: Optimality for \(E\text{-}[0,1]\) convex multi-objective programming problems