关于集值映射向量优化问题的对偶问题  

The Dual Problem of Vector Optimization of Set-valued Maps

作　　者：刘秀红[1] 

机构地区：[1]山东财政学院统计与数理学院,山东省济南市250014

出　　处：《曲阜师范大学学报（自然科学版）》2008年第4期54-56,共3页Journal of Qufu Normal University(Natural Science)

摘　　要：在拓扑线性空间中,针对带有约束条件的集值向量优化问题,采用抽象的拉格朗日乘子法,将其转化为无条件集值向量优化问题求解;讨论了其拉格朗日型对偶问题,得到了若干结果.In real ordered linear topological space, vector optimization of set-valued maps with constrain condition is considered. Using an abstract Lagrange multiplier, it can be transform into a optimal problem with non-constrain condition. The Lagrange＇s type dual problem is discussed and some duality theorem are obtained.

关 键 词：集值映射 (弱)有效元 最优元 拉格朗日乘子 对偶问题 

分 类 号：O221.2[理学—运筹学与控制论]