Solving linear programming problems with neural networks: a comparative study
- 1 January 1995
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks
- Vol. 6 (1) , 94-104
- https://doi.org/10.1109/72.363446
Abstract
In this paper we study three different classes of neural network models for solving linear programming problems. We investigate the following characteristics of each model: model complexity, complexity of individual neurons, and accuracy of solutions. Simulation examples are given to illustrate the dynamical behavior of each modelKeywords
This publication has 21 references indexed in Scilit:
- Appendix: The Definition of Numerical AnalysisPublished by Society for Industrial & Applied Mathematics (SIAM) ,2011
- Time complexity modeling and comparison of parallel architectures for Fourier transform oriented algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Mapping of neural networks on honeycomb architectures: area analysisPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Linear and quadratic programming neural network analysisIEEE Transactions on Neural Networks, 1992
- Neural networks for solving systems of linear equations and related problemsIEEE Transactions on Circuits and Systems I: Regular Papers, 1992
- Nonlinear switched capacitor 'neural' networks for optimization problemsIEEE Transactions on Circuits and Systems, 1990
- Simple 'neural' optimization networks: An A/D converter, signal decision circuit, and a linear programming circuitIEEE Transactions on Circuits and Systems, 1986
- The Area-Time Complexity of Binary MultiplicationJournal of the ACM, 1981
- Polynomial algorithms in linear programmingUSSR Computational Mathematics and Mathematical Physics, 1980
- Necessary and sufficient conditions for a penalty method to be exactMathematical Programming, 1975