E-super efficiency of set-valued optimization problems involving improvement sets
From MaRDI portal
Publication:898722
Recommendations
- \(E\)-strong efficiency of set-valued optimization problems
- \(\varepsilon\)-super efficient solutions of optimization problems with set-valued maps in locally convex spaces
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Super efficiency in vector optimization of set-valued maps
- On super efficiency in set-valued optimization
Cites work
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 3662118 (Why is no real title available?)
- scientific article; zbMATH DE number 1779481 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- A theorem of the alternative and its application to the optimization of set-valued maps
- An improved definition of proper efficiency for vector maximization with respect to cones
- Characterizations of super efficiency in cone-convexlike vector optimization with set-valued maps
- Characterizations of the \(E\)-Benson proper efficiency in vector optimization problems
- Improvement sets and vector optimization
- Near-subconvexlikeness in vector optimization with set-valued functions
- Proper efficiency and the theory of vector maximization
- Proper efficiency in locally convex topological vector spaces
- Proper efficiency with respect to cones
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Strong efficiency in a locally convex space
- Super Efficiency in Vector Optimization
- Super efficiency in the nearly cone-subconvexlike vector optimization with set-valued functions
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- Vector optimization problems via improvement sets
- Weak \(E\)-optimal solution in vector optimization
- \(E\)-Benson proper efficiency in vector optimization
- \(e\)-proper saddle points and \(e\)-proper duality in vector optimization with set-valued maps
- e-weak minimal solutions of vector optimization problems with set-valued maps
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
Cited in
(7)- Density and connectedness of optimal points with respect to improvement sets
- \(E\)-strong efficiency of set-valued optimization problems
- Scalarizations and optimality of constrained set-valued optimization using improvement sets and image space analysis
- A kind of unified strict efficiency via improvement sets in vector optimization
- On super efficiency in set-valued optimization
- The connectedness of the solutions set for set-valued vector equilibrium problems under improvement sets
- Stability of optimal points with respect to improvement sets
This page was built for publication: \(E\)-super efficiency of set-valued optimization problems involving improvement sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898722)
