A Recurrent Neural Network for Solving Bilevel Linear Programming Problem Academic Article uri icon

abstract

  • In this brief, based on the method of penalty functions, a recurrent neural network (NN) modeled by means of a differential inclusion is proposed for solving the bilevel linear programming problem (BLPP). Compared with the existing NNs for BLPP, the model has the least number of state variables and simple structure. Using nonsmooth analysis, the theory of differential inclusions, and Lyapunov-like method, the equilibrium point sequence of the proposed NNs can approximately converge to an optimal solution of BLPP under certain conditions. Finally, the numerical simulations of a supply chain distribution model have shown excellent performance of the proposed recurrent NNs.

author list (cited authors)

  • He, X., Li, C., Huang, T., Li, C., & Huang, J.

citation count

  • 99

publication date

  • March 2014