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

Connectedness of G—proper Efficient Solution Set for Multiobjective Programming Problem
引用本文:KONGXiang-qing. Connectedness of G—proper Efficient Solution Set for Multiobjective Programming Problem[J]. 系统科学与系统工程学报(英文版), 2002, 11(3): 345-349
作者姓名:KONGXiang-qing
作者单位:KONG Xiang-qingJiaxing College,Jiaxing 314001,Zhejiang,China
基金项目:This work is supported by Research Foundation of the Education Departm entof Zhejiang Province(2 0 0 10 2 80 )
摘    要:1  IntroductionWe know that one of the mostimportant problems of multiobjective programming is to in-vestigate the structure of efficientsolution sets. Among the topological properties of thesesets,connectedness is of interest.In Euclidean space,many results have been obtainedabout the connectedness of efficient solution set in past.The set of efficient solution isconnected when the objective functions are strictly quasiconcave[1 ] .In general,efficientsolution set is so large for multiobjec…

关 键 词:程序设计  有效解集  连通性

Connectedness of G-proper Efficient Solution Set for Multiobjective Programming Problem
KONG Xiang-qing. Connectedness of G-proper Efficient Solution Set for Multiobjective Programming Problem[J]. Journal of Systems Science and Systems Engineering, 2002, 11(3): 345-349
Authors:KONG Xiang-qing
Affiliation:Jiaxing College, Jiaxing 314001, Zhejiang , China
Abstract:In this paper, we investigate the connectedness of G-proper efficient solution set for multiobjective programming problem. It is shown that the G-proper efficient solution set is connected if objective functions are convex. A sufficient condition for the connectedness of G-proper efficient solution set is established when objective functions are strictly quasiconvex.
Keywords:multiobjective programming  efficient solution set  G-proper efficient solution set  strictly quasiconvex function  connectedness
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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