Monthly
288 pp. per issue
6 x 9, illustrated
ISSN
0899-7667
E-ISSN
1530-888X
2014 Impact factor:
2.21

Neural Computation

November 2010, Vol. 22, No. 11, Pages 2962-2978
(doi: 10.1162/NECO_a_00029)
© 2010 Massachusetts Institute of Technology
A Novel Recurrent Neural Network with Finite-Time Convergence for Linear Programming
Article PDF (553.64 KB)
Abstract

In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.