title: A recurrent neural network for solving bilevel linear programming problem.
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.
authors.forename: Xing
authors.initials: X
authors.lastname: He
authors.forename: Chuandong
authors.initials: C
authors.lastname: Li
authors.forename: Tingwen
authors.initials: T
authors.lastname: Huang
authors.forename: Chaojie
authors.initials: C
authors.lastname: Li
authors.forename: Junjian
authors.initials: J
authors.lastname: Huang
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D005246:Feedback; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*; D011382:Programming, Linear