Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
From MaRDI portal
Publication:2278444
DOI10.1515/math-2019-0104zbMath1427.90233OpenAlexW2981842572MaRDI QIDQ2278444
Publication date: 5 December 2019
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/math-2019-0104
set-valued mapsBenson proper efficiencyvector closuregeneralized cone subconvexlikenessrelative algebraic interior
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuity of second-order adjacent derivatives for weak perturbation maps in vector optimization
- Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
- Lower Studniarski derivative of the perturbation map in parametrized vector optimization
- Stability results for convex vector-valued optimization problems
- Sensitivity and stability for the second-order contingent derivative of the proper perturbation map in vector optimization
- Proper efficiency in vector optimization on real linear spaces.
- Generalized second-order contingent epiderivatives in parametric vector optimization problems
- Duality and saddle-points for convex-like vector optimization problems on real linear spaces
- Higher order optimality conditions for Henig efficient solutions in set-valued optimization
- An improved definition of proper efficiency for vector maximization with respect to cones
- Proper efficiency with respect to cones
- Benson proper efficiency in the vector optimization of set-valued maps
- A theorem of the alternative and its application to the optimization of set-valued maps
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- The optimality conditions for vector optimization of set-valued maps
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- Near-subconvexlikeness in vector optimization with set-valued functions
- On Lagrange duality theory for dynamics vaccination games
- New generalized convexity notion for set-valued maps and application to vector optimization
- Theorems of the alternative and optimization with set-valued maps
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Stability analysis for higher-order adjacent derivative in parametrized vector optimization
- Higher-order optimality conditions for weakly efficient solutions in nonconvex set-valued optimization
- \(\epsilon\)-optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- Proper Efficient Points for Maximizations with Respect to Cones
- Super Efficiency in Vector Optimization
- Optimality conditions of set-valued optimization problem involving relative algebraic interior in ordered linear spaces
This page was built for publication: Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
