Abstract: With the homotopy method we solved the nonconvex nonlinear programming with equality and inequality constrains. The feasible area for this kind of programming changes into boundary, and there is no interior point. We defined the new quasicone condition, established the homotopy equation and proved the global convergence of this homotopy method.

Key words: nonconvex programming, homotopy method, quasicone condition