吉林大学学报（理学版）Issue(2)：212-218,7.DOI:10.13413/j.cnki.jdxblxb.2014.02.10
混合约束多目标优化问题的凝聚同伦内点方法
Aggregate Homotopy Interior-Point Method for Multiobjective Programming Problem with Equality and Inequality Constraints
摘要
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分类
数理科学引用本文复制引用
贺莉,谭佳伟,陈嘉,刘庆怀..混合约束多目标优化问题的凝聚同伦内点方法[J].吉林大学学报（理学版）,2014,(2):212-218,7.基金项目
国家自然科学基金(批准号:10771020)和吉林省自然科学基金(批准号:20130101061JC （批准号:10771020）
201215128) （）
