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