集函数多目标分式规划的最优性和广义凸对偶性  

Optimality and Generalized Convex Duality for MultiobjectiveFractional Programming with Set Functions

作　　者：孙美[1] 段虞荣[1] 

机构地区：[1]首钢数据管理部,重庆大学

出　　处：《应用数学》1996年第2期203-207,共5页Mathematica Applicata

摘　　要：本文讨论了集函数多目标（分母不同）分式规划，给出了Ｇｅｏｆｆｒｉｏｎ正常有效解的必要和充分条件，并讨论了关于有效解的广义凸对偶理论．This paper discusses the theorems of Geoffrion' s properly efficient solution for multiobjective fractional programming with set functions. Under some ρ-convexity and generalized ρconvexity assumptions, we also discuss the duality theory for the above multiobjective programming with set functions.

关 键 词：集函数 多目标分式规划 最优性 广义凸对偶性 

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