-transparent.png){kind=logo}
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.
| UI | MeSH Term | Description | Entries |
|---|
Related Publications
S H Zak, and
V Upatising, and
S Hui
January 1997,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
January 1995,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
February 1999,
International journal of neural systems,
S H Zak, and
V Upatising, and
S Hui
January 1996,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
May 2017,
Neural networks : the official journal of the International Neural Network Society,
S H Zak, and
V Upatising, and
S Hui
January 1996,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
January 1996,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
March 2022,
IEEE transactions on cybernetics,
S H Zak, and
V Upatising, and
S Hui
January 2001,
IEEE transactions on neural networks,
S H Zak, and
V Upatising, and
S Hui
May 2001,
Physical review letters,
