Nonlinear bilevel programming lacks efficient algorithms due to its computational difficulties such as nonconvexity and NP-hardness.

• 摘要由于非线性两层规划具有非凸性、NP-难等计算困难，高效的算法并不多见。