\( \varepsilon \)-properly efficiency of multiobjective semidefinite programming with set-valued functions (Q1992929)

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.