Scalarization of -super efficient solutions of set-valued optimization problems in real ordered linear spaces
Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
The concept of an \(\epsilon\)-super efficient element in real ordered linear spaces and the concept of cone subconvexlikeness are introduced. The separation theorem of convex sets is used to establish a dual decomposition in the sense of \(\epsilon\)-super efficiency under the assumption of generalized cone subconvexlikeness. As an application of the dual decomposition, a scalarization theorem of \(\epsilon\)-super efficient solutions of set-valued optimization problems is established. Another nonlinear scalarization theorem without any convexity assumption is proved in the further part of the paper. The results are illustrated by small numerical examples.
- Scalarizations of super efficient solutions to set-valued optimization problems in real linear spaces
- \(\varepsilon\)-super efficient solutions of optimization problems with set-valued maps in locally convex spaces
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Super efficiency in vector optimization with nearly convexlike set-valued maps.
- -super efficient solutions of set-valued optimization with ic-cone-convexlikeness
- \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
- -optimality conditions of vector optimization problems with set-valued maps based on the algebraic interior in real linear spaces
- An improved definition of proper efficiency for vector maximization with respect to cones
- e-weak minimal solutions of vector optimization problems with set-valued maps
- scientific article; zbMATH DE number 3901504 (Why is no real title available?)
- scientific article; zbMATH DE number 1568704 (Why is no real title available?)
- Proper efficiency and the theory of vector maximization
- Proper efficiency in locally convex topological vector spaces
- Proper efficiency in vector optimization on real linear spaces.
- Proper efficiency with respect to cones
- Proper Efficient Points for Maximizations with Respect to Cones
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Super Efficiency in Vector Optimization
- Superefficiency in vector optimization with nearly subconvexlike set-valued maps
- The optimality conditions for vector optimization of set-valued maps
- Weak and proper efficiency in set-valued optimization on real linear spaces
- Weak efficiency in vector optimization using a closure of algebraic type under cone-convexlikeness.
- ε-Optimality Conditions for Vector Optimization Problems with Set-Valued Maps
- ∊-STRICTLY EFFICIENT SOLUTIONS OF VECTOR OPTIMIZATION PROBLEMS WITH SET-VALUED MAPS
- Scalarization of set-valued optimization problems with generalized cone subconvexlikeness in real ordered linear spaces
- Approximate Benson efficient solutions for set-valued equilibrium problems
- Characterizations of Benson proper efficiency of set-valued optimization in real linear spaces
- Generic stability of the solution mapping for set-valued optimization problems
- Scalarizations of super efficient solutions to set-valued optimization problems in real linear spaces
- Nonconvex Separation Functional in Linear Spaces with Applications to Vector Equilibria
- (C, )-super subdifferentials of set-valued maps and optimality conditions for set-valued optimization problems
- Approximate Benson properly efficient solutions for set-valued equilibrium problems
- Weakly nondominated solutions of set-valued optimization problems with variable ordering structures in linear spaces
- Linear and nonlinear scalarization methods for vector optimization problems with variable ordering structures
- \(\epsilon \)-Henig proper efficiency of set-valued optimization problems in real ordered linear spaces
This page was built for publication: Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q467463)
