期刊文献+

Connectedness of G-proper Efficient Solution Set for Multiobjective Programming Problem

Connectedness of G-proper Efficient Solution Set for Multiobjective Programming Problem
原文传递
导出
摘要 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. 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.
出处 《Systems Science and Systems Engineering》 CSCD 2002年第3期345-349,共5页 系统科学与系统工程学报(英文版)
基金 This work is supported by Research Foundation of the Education Departm entof Zhejiang Province(2 0 0 10 2 80 )
关键词 multiobjective programming efficient solution set G-proper efficient solution set strictly quasiconvex function connectedness multiobjective programming efficient solution set G-proper efficient solution set strictly quasiconvex function connectedness
  • 相关文献

参考文献1

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部