摘要

In this paper, a constraint shifting combined homotopy method for solving multi-objective programming problems with both equality and inequality constraints is presented. It does not need the starting point to be an interior point or a feasible point and hence is convenient to use. Under some assumptions, the existence and convergence of a smooth path to an efficient solution are proven. Simple numerical results are given.

全文