ε-Properly Efficiency of Multiobjective Semidefinite Programming with Set-Valued Functions

Abstract EN

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.