吉林大学学报(理学版)

• 数学 • 上一篇    下一篇

混合约束多目标优化问题的凝聚同伦内点方法

贺莉, 谭佳伟, 陈嘉, 刘庆怀   

  1. 长春工业大学 基础科学学院, 长春 130012
  • 收稿日期:2013-06-24 出版日期:2014-03-26 发布日期:2014-03-20
  • 通讯作者: 刘庆怀 E-mail:liuqh6195@126.com

Aggregate Homotopy InteriorPoint Method forMultiobjective Programming Problem withEquality and Inequality Constraints

HE Li, TAN Jiawei, CHEN Jia, LIU Qinghuai   

  1. School of Basic Science, Changchun University of Technology, Changchun 130012, China
  • Received:2013-06-24 Online:2014-03-26 Published:2014-03-20
  • Contact: LIU Qinghuai E-mail:liuqh6195@126.com

摘要:

考虑用凝聚同伦内点法求解带有等式和不等式约束的凸多目标优化问题, 先用凝聚函数法将目标函数和约束条件进行光滑逼近, 再用组合同伦方法证明可行域内任一点在广义弱法锥条件下几乎处处收敛于混合多目标问题的弱有效解. 数值计算结果表明, 所给方法有效、 可行.

关键词: 多目标优化, 凝聚函数, 同伦方法

Abstract:

The aggregate homotopy interiorpoint method was used to solve the convex multiobjective programming problem with mixed equality and inequality constraints. The objective functions and contraints were smoothed with aggregate functions. A path tracing algorithm was adopted to find its weakeffective solutions, which was proved by homotopy method. Numerical examples demonstrated the effectivness and feasibility of this method.

Key words: multiobjective programming, aggregate function, homotopy method

中图分类号: 

  • O221