There are many classical solution methods for bilevel programming such as culmination searching algorithm,branch and bound algorithm and penalty function algorithm.

• 对于二层规划问题有许多经典的求解方法,如极点搜索法、分支定界法和罚函数法等。