Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces (Q467463): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s10957-014-0565-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965299678 / rank | |||
Normal rank |
Revision as of 19:48, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces |
scientific article |
Statements
Scalarization of \(\epsilon\)-super efficient solutions of set-valued optimization problems in real ordered linear spaces (English)
0 references
3 November 2014
0 references
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.
0 references
set-valued maps
0 references
generalized cone subconvexlikeliness
0 references
efficient solutions
0 references
scalarization
0 references