ε-weak efficient solutions of multiobjective semidefinite programming with set-valued maps are discussed.Under the condition of nearly cone-subconvexlikeness,the alternative theorem which contained matrix and vector is established,then the ε-Lagrange multiplier theorem,the scalarization theorem and ε-weak saddle point theorem of the primal programming are obtained.%对于集值映射多目标半定规划问题,在近似锥-次类凸的框架下,建立了含矩阵和向量的择一性定理,给出了问题的ε-弱有效解的ε-Lagrange乘子定理及标量化定理和ε-弱鞍点定理.
展开▼