Skip to main content

A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 834))

Abstract

In this paper we put forward a neural network model for quadratic programming problems with simple upper and lower bounds and analyze the properties of solutions obtained by the model. It is shown that linear programming problems can be transferred into such quadratic programming problems and be solved by the model.

This work is supported partly by the National Natural Science Foundation of China(No. 101931209) and by the Hong Kong Baptist College(Proj. No. FRG /93-94/II-05).

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hopfield, J.J. & Tank, D.W., (1985). Neural computation of decision in optimization problems. Biological cybernetics, 52, 141–152.

    PubMed  Google Scholar 

  2. Tank, D.W., & Hopfield, J.J., (1986). Simple neural optimization networks: An A/D converter, signal decision network and a linear programming circuit. IEEE transactions on circuit and systems, 33, 533–541.

    Article  Google Scholar 

  3. Kennedy, M.P., & Chua, L.O., (1988). Neural networks for nonlinear programming. IEEE transactions on circuit and systems, 35, 554–562.

    Article  Google Scholar 

  4. Bouzerdoum, A., & Pattison, T.R., (1993). Neural network for quadratic optimization with bound constraints. IEEE transactions on neural networks. 4, 293–304.

    Article  Google Scholar 

  5. Maa, C.Y., & Shanblatt, M.A., (1992). Linear and quadratic programming neural network analysis. IEEE transactions on neural networks, 3, 380–394.

    Google Scholar 

  6. Hopfield, J.J., Neurons with graded response have collective computational properties like those of two-state neurons. proceedings of natural academic science, USA, 81, 3088–3092.

    Google Scholar 

  7. Aiger, S.V.B., et al., (1990). A theoretical investigation into the performance of the Hopfield model. IEEE transactions on neural networks, 1, 204–215.

    Article  Google Scholar 

  8. Lasalle, (1976). the stability of dynamical systems. J.W.Arrowsmith Ltd.

    Google Scholar 

  9. Coste, J., et al., (1979). Simple kinetic model of symmetry breaking. Journal of statistical physics, 21, 33–50.

    Google Scholar 

  10. Arthur, R.M., (1969). Species packing and what interspecies competition minimizes. proceedings of natural academic science, USA, 64, 1369–1371.

    Google Scholar 

  11. Nemhauser, G.L., (1989). et al. Optimization. North-Holland.

    Google Scholar 

  12. Karmarkar, N., (1984). A new polynomial time algorithm for linear programming. Combinatoria, 4, 373–395.

    Google Scholar 

  13. Fletcher, (1980). Practical methods of optimization. Volume 1: Unconstrained optimization. John Wiley & Sons.

    Google Scholar 

  14. Gill, P., (1981). et al. Practical Optimization. Academic Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Xs., Zhu, Hc. (1994). A neural network model for quadratic programming with simple upper and lower bounds and its application to linear programming. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_173

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_173

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics