A Neural Network Method for Nonlinear Bilevel Programming Problems

Yibing Lü · Journal of Yangtze University · 2011

This paper mainly studies the algorithm for solving the nonlinear bilevel programming problem,of which the lower problem is convex programming.When the lower problem is convex programming problem,the K-T conditions are used instead of the lower problem to transform the nonlinear bilevel programming into the corresponding single level programs,then a penalty function is structured for the nonlinear programming problem,the method of neural networks is proposed for solving the problem,the numerical experiment results show the method is feasible and effective.

Read the paper · More papers on PaperTik