Solving linear programming problems with neural networks: a comparative study.
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 model.
Zak
S H
SH
Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN.
Upatising
V
V
Hui
S
S