\( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions
From MaRDI portal
Publication:1992929
DOI10.1155/2017/5978130zbMath1426.90234OpenAlexW2599439082WikidataQ59147652 ScholiaQ59147652MaRDI QIDQ1992929
Publication date: 5 November 2018
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2017/5978130
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Unnamed Item
- Vector optimization problems via improvement sets
- Weak sharp minima for set-valued vector variational inequalities with an application
- Theory of multiobjective optimization
- Benson proper efficiency in the vector optimization of set-valued maps
- Optimality conditions for proper efficient solutions of vector set-valued optimization.
- Near-subconvexlikeness in vector optimization with set-valued functions
- Duality for vector optimization of set-valued functions
- A property of efficient and \(\varepsilon\)-efficient solutions in vector optimization
- E-Benson proper efficiency in vector optimization
- e-weak minimal solutions of vector optimization problems with set-valued maps
This page was built for publication: \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions