一般多目标优化问题的凝聚同伦内点算法  

Aggregate homotopy interior-point method for general multiobjective programming

作　　者：贺莉[1] 郭旭[1] 温延红[2] 戴嘉轩 

机构地区：[1]长春工业大学基础科学学院,吉林长春130012 [2]长春职业技术学院,吉林长春130033

出　　处：《长春工业大学学报》2014年第6期601-606,共6页Journal of Changchun University of Technology

基　　金：国家自然科学基金资助项目(10771020);吉林省自然科学基金资助项目(20130101061JC)

摘　　要：用凝聚函数把等价转化后的不等式约束条件进行光滑逼近,对目标函数进行线性加权转化成单目标函数,然后利用组合同伦内点方法求解多目标优化问题的最小弱有效解,并证明该方法是整体收敛的。Inequality constraint conditions after equivalent transformation is smooth approximated by means of aggregate function ,and then the multi‐objective function is transferred into a single objective function with linear weighing . We get the minimal weak efficient solution for the multi‐objective optimization problem via the aggregate homotopy method ,and prove that it is globally convergent .

关 键 词：多目标规划 凝聚函数 同伦方法 

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