A homotopy method for solving bilevel programming problem Original Research Article

A homotopy method for solving bilevel programming problem (BLPP) is proposed. The algorithm is based on constructing the homotopy equation for BLPP. One satisfiable sufficient condition is given to ensure that the point of homotopy path globally converges to a K–K–T point of BLPP. Numerical results are presented to show the effectiveness of this method.