Abstract—This paper, we discussed a general multi-objective optimization problem under quasi-normal cone condition. we prove that for almost every point in the feasible region, a smooth and bounded homotopy path can be derived and that the algorithm converges to the K-K-T point of multi-objective programming problem. Numerical simulation confirmed the viability of this method.
Index Terms—multi-objective programming; homotopy method; global convergence.
He Li is with the Changchun University of Technology, Changchun 130012, P. R. China (e-mail: heli_xu@yahoo.com.cn).
Wang Xiu-yu is with the Changchun University of Technology, Changchun 130012, P. R. China (e-mail: wangxiuyu@mail.ccut.edu.cn)
Jin Jian-lu is with. the Changchun University of Technology, Changchun 130012, P. R. China (e-mail: Jinjianlu@mail.ccut.edu.cn)
Liu Qing-huai is with the Changchun University of Technology, Changchun 130012, P. R. China (Corresponding author, Phone: +86-13394492005, e-mail: liuqh6195@126.com).
Cite: He Li, Wang Xiu-yu, Jin Jian-lu, Liu Qing-huai, "Solving Multi-Object Programming Problems by Homotopy Inner Point Method under Quasi-Normal Cone Condition," International Journal of Modeling and Optimization vol. 1, no. 1, pp. 1-6, 2011.
Copyright © 2008-2025. International Journal of Modeling and Optimization. All rights reserved.
E-mail: ijmo@iacsitp.com