\( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions (Q1992929)
From MaRDI portal
!
WARNING
This is the item page for this Wikibase entity, intended for internal use and editing purposes.
Please use the normal view instead:
scientific article; zbMATH DE number 6972275
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | \( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions |
scientific article; zbMATH DE number 6972275 |
Statements
\( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions (English)
0 references
5 November 2018
0 references
Summary: In this paper, we study the \(\varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions. Firstly, we obtain the scalarization theorems under the condition of the generalized cone-subconvexlikeness. Then, we establish the alternative theorem which contains matrixes and vectors, the \(\varepsilon \)-Lagrange multiplier theorems, and the \(\varepsilon \)-proper saddle point theorems of the primal programming under some suitable conditions.
0 references
0 references
0.8820003271102905
0 references
0.8750710487365723
0 references
0.8159897923469543
0 references
