A Combined Homotopy Method for Nonconvex Multi-objective Programming Problem with equality and inequality constrains
We solve a class of nonconvex multi-objective programming problem with equality and inequality constrains using the homotopy method. We develop a new shifted cone condition and generate the homotopy equation. Uder that conditions, 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 multiobjective programming problem.
multi-objective homotopy method shifted cone condition
He Li Wang Xiu-yu Jin Jian-lu Liu Qing-huai
School of Basic Science Changchun University of Technology Changchun 130012, P. R. China
国际会议
长春
英文
81-84
2010-08-24(万方平台首次上网日期,不代表论文的发表时间)