J4

• • 上一篇    下一篇

求双目标凸规划问题有效解集的内点同伦算法

杨轶华1, 吕显瑞1, 刘庆怀1, 郑志莹2   

  1. 1. 吉林大学 数学学院, 长春 130012; 2. 北华大学 教育技术中心, 吉林省 吉林 132000
  • 收稿日期:2005-04-11 修回日期:1900-01-01 出版日期:2006-01-26 发布日期:2006-01-26
  • 通讯作者: 吕显瑞

Homotopy-interior Point Algorithm for Solving Set of Effective Solutions of Double-objective Convex Programming

YANG Yi-hua1, LV Xian-rui1, LIU Qing-huai1, ZHENG Zhi-ying2   

  1. 1. College of Mathematics, Jilin University, Changchun 130012, China; 2. Educational and Technical Centre, Beihua University, Jilin 132000, Jilin Province, China
  • Received:2005-04-11 Revised:1900-01-01 Online:2006-01-26 Published:2006-01-26
  • Contact: LV Xian-rui

摘要: 利用具有大范围收敛性的同伦方法, 对双目标凸规划问题构造了一种直接算法——内点同伦算法, 通过该算法可求出有效解(弱有效解)的集合, 并证明了这种算法的大范围收敛性, 数值例子表明, 此算法是可行有效的.

关键词: 多目标凸规划, 双目标凸规划, 有效解, 弱有效解

Abstract: We have solved double-objective convex programming by means of homotopy-interior point algorithm. Not only the efficient(weak efficient) solutions but also the set of all efficient(weak efficient)solutions can be obtained by this method. We have also proved the global convergence of this homotopy-interior point algorithm. Moreover, the results of the numeric examples show that this method is feasible and effective.

Key words: multi-objective convex programming, double-objective convex programing, efficient solution, weak efficient solution

中图分类号: 

  • O221