A Noninterior Path following Algorithm for Solving a Class of Multiobjective Programming Problems

被引:0
|
作者
Su, Menglong [1 ,2 ]
Zha, Zhengbang [1 ,3 ]
Xu, Zhonghai [4 ]
机构
[1] Luoyang Normal Univ, Coll Math, Luoyang 471022, Peoples R China
[2] Jilin Univ, Minist Educ, Key Lab Symbol Computat & Knowledge Engn, Changchun 130012, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, Beijing 100093, Peoples R China
[4] Harbin Inst Technol, Natl Key Lab Sci & Technol Adv Composites Special, Harbin 150080, Peoples R China
关键词
POLYNOMIAL-TIME ALGORITHM; PRIMAL-DUAL ALGORITHMS; HOMOTOPY METHOD; CONSTRUCTIVE PROOF; OPTIMIZATION; CONTINUATION; STABILITY; ZEROS;
D O I
10.1155/2014/835819
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Multiobjective programming problems have been widely applied to various engineering areas which include optimal design of an automotive engine, economics, and military strategies. In this paper, we propose a noninterior path following algorithm to solve a class of multiobjective programming problems. Under suitable conditions, a smooth path will be proven to exist. This can give a constructive proof of the existence of solutions and lead to an implementable globally convergent algorithm. Several numerical examples are given to illustrate the results of this paper.
引用
收藏
页数:10
相关论文
共 50 条