Title of article
A homotopy method for solving bilevel programming problem Original Research Article
Author/Authors
Dao Li Zhu، نويسنده , , Qing Xu، نويسنده , , Zhenghua Lin، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2004
Pages
12
From page
917
To page
928
Abstract
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.
Keywords
normal cone condition , Bilevel programs , Nonconvex programs , Homotopy method
Journal title
Nonlinear Analysis Theory, Methods & Applications
Serial Year
2004
Journal title
Nonlinear Analysis Theory, Methods & Applications
Record number
858622
Link To Document