No abstract

No abstract

No abstract

No abstract

In this paper, we study the -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 -Lagrange multiplier theorems, and the -proper saddle point theorems of the primal programming under some suitable conditions.