A new neural network for solving linear and quadratic programming problems

A new neural network for solving linear and quadratic programming problems is presented and is shown to be globally convergent. The new neural network improves existing neural networks for solving these problems, that is, it avoids the parameter turning problem, is capable of achieving the exact solutions, and uses only simple hardware in which no analog multipliers for variables are required. Furthermore, the network salves both the primal problems and their dual problems simultaneously.