摘要
In this paper,we consider an optimistic nonlinear bilevel programming problem.Under some conditions,we first show that the sequence of solutions to penalty problems converges to the optimal solution of the original bilevel programming problem.We then present an objective penalty method to solve such a problem.Finally,some numerical experiments are performed to illustrate its feasibility.
基金
This work was supported by the National Natural Science Foundation of China(Nos.11501233 and 61673006)
the Natural Science Research Project of Universities of Anhui Province(No.KJ2016B025).
