首页 | 本学科首页   官方微博 | 高级检索  
     检索      

多目标半定规划的互补弱鞍点和G-鞍点最优性条件
引用本文:王晓敏,李超.多目标半定规划的互补弱鞍点和G-鞍点最优性条件[J].运筹学学报,2005,9(1):75-81.
作者姓名:王晓敏  李超
作者单位:上海交通大学数学系,上海,200030
摘    要:对于含矩阵函数半定约束和多个目标函数的多目标半定规划问题,给出Lagrange函数在弱有效意义下的互补弱鞍点和Geofrrion恰当有效意义下的G-鞍点的定义及其等价定义.然后,在较弱的凸性条件下,利用含矩阵和向量约束的择一性定理,建立多目标半定规划的互补弱鞍点和G-鞍点充分必要条件.

关 键 词:鞍点  半定规划  最优性条件  Lagrange函数  矩阵函数  充分必要条件  等价定义  互补  约束  多目标

Complemental Weak Saddle Point and G-Saddle Point Theorem for Multiobjective Semidefinite Programming
Wang Xiaomin,Li Chao.Complemental Weak Saddle Point and G-Saddle Point Theorem for Multiobjective Semidefinite Programming[J].OR Transactions,2005,9(1):75-81.
Authors:Wang Xiaomin  Li Chao
Institution:Wang Xiaomin Li Chao Department of Mathematics,Shanghai Jiaotong University,Shanghai 200030,
Abstract:Multiobjective semidefinite programming with a semidefinite constraint is studied in this paper. The definitions and equivalent definitions of the weak saddle point under the means of the weak efficient solution and the G-saddle point under the means of the G-efficient solution are given. The saddle point type necessary and sufficient conditions are obtained by an alternative theorem under a weakly convex condition.
Keywords:Operations research  semidefinite programming  multiobjective programming  multiobjective semidefinite programming  alternative theorem  complemental weak saddle point  G-saddle point
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号