Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces (Q467463): Difference between revisions

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.