Neural network for solving linear programming problems with bounded variables
- 1 March 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 6 (2), 515-519
- https://doi.org/10.1109/72.363493
Abstract
A new neural network for solving linear programming problems with bounded variables is presented. The network is shown to be completely stable and globally convergent to the solutions to the linear programming problems. The proposed new network is capable of achieving the exact solutions, in contrast to existing optimization neural networks which need a suitable choice of the network parameters and thus can obtain only approximate solutions. Furthermore, both the primal problems and their dual problems are solved simultaneously by the new network.Keywords
This publication has 6 references indexed in Scilit:
- Neural network for quadratic optimization with bound constraintsIEEE Transactions on Neural Networks, 1993
- Linear and quadratic programming neural network analysisIEEE Transactions on Neural Networks, 1992
- A two-phase optimization neural networkIEEE Transactions on Neural Networks, 1992
- Neural networks for nonlinear programmingIEEE Transactions on Circuits and Systems, 1988
- Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuitIEEE Transactions on Circuits and Systems, 1986
- The Stability of Dynamical SystemsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1976