DocumentCode :
1888367
Title :
The Aggregate Homotopy Interior-Point Method for a Class of Multi-Objective Programming Problems
Author :
He Li ; Dong Xiao-gang ; Zhao Jia-qi ; Liu Qing-huai
Author_Institution :
Sch. of Basic Sci., Changchun Univ. of Technol., Changchun, China
fYear :
2010
fDate :
25-26 Dec. 2010
Firstpage :
1
Lastpage :
4
Abstract :
We solve a class of convex multi-objective programming problems using aggregate homotopy method. By the means of aggregate function, we transform a multi-objective programming problem with constrains into a uniobjective programming problem with a single constrain. Combined homotopy interior-point method is used to solve the single-object optimization problem; the minimal weak efficient solution of the multi-objective optimization problem has been obtained by path tracking.
Keywords :
convex programming; aggregate function; aggregate homotopy interior-point method; aggregate homotopy method; combined homotopy interior-point method; convex multiobjective programming problems; minimal weak efficient solution; multiobjective optimization problem; path tracking; single-object optimization problem; uniobjective programming problem; Aggregates; Convergence; Equations; Manifolds; Optimization; Programming profession;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Engineering and Computer Science (ICIECS), 2010 2nd International Conference on
Conference_Location :
Wuhan
ISSN :
2156-7379
Print_ISBN :
978-1-4244-7939-9
Electronic_ISBN :
2156-7379
Type :
conf
DOI :
10.1109/ICIECS.2010.5677798
Filename :
5677798
Link To Document :
بازگشت