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

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

作　　者：贺莉[1] 谭佳伟[1] 陈嘉[1] 刘庆怀[1] 

机构地区：[1]长春工业大学基础科学学院,长春130012

出　　处：《吉林大学学报（理学版）》2014年第2期212-218,共7页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:10771020);吉林省自然科学基金(批准号:20130101061JC;201215128)

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

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

分 类 号：O221[理学—运筹学与控制论]