Neural network for solving linear programming problems with bounded variables

Authors:
Youshen Xia;Jiasong Wang
Affiliations:
Nanjing Inst. of Posts & Telecommun.;-
Venue:
IEEE Transactions on Neural Networks
Year:
1995

Citing 0
Cited 8

A Novel Method to Handle Inequality Constraints for Convex Programming Neural Network

Neural Processing Letters
On the Synthesis of Brain-State-in-a-Box Neural Models with Application to Associative Memory

Neural Computation
2008 Special Issue: Two k-winners-take-all networks with discontinuous activation functions

Neural Networks
Improved Results on Solving Quadratic Programming Problems with Delayed Neural Network

ISNN '07 Proceedings of the 4th international symposium on Neural Networks: Advances in Neural Networks, Part III
A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem

IEEE Transactions on Neural Networks
A new one-layer neural network for linear and quadratic programming

IEEE Transactions on Neural Networks
A novel recurrent neural network with finite-time convergence for linear programming

Neural Computation
Neural network for solving convex quadratic bilevel programming problems

Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new neural network for solving linear programming problems with bounded variables is presented. The network is shown to be completely stable and globally convergent to the solutions to the linear programming problems. The proposed new network is capable of achieving the exact solutions, in contrast to existing optimization neural networks which need a suitable choice of the network parameters and thus can obtain only approximate solutions. Furthermore, both the primal problems and their dual problems are solved simultaneously by the new network