Solving linear programming problems with neural networks: a comparative study

  • Authors:
  • S. H. Zak;V. Upatising;S. Hui

  • Affiliations:
  • Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN;-;-

  • Venue:
  • IEEE Transactions on Neural Networks
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

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