Skip to main content

Solving Extended Linear Programming Problems Using a Class of Recurrent Neural Networks

  • Conference paper
Neural Information Processing (ICONIP 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4233))

Included in the following conference series:

  • 1398 Accesses

Abstract

Extended linear programming (ELP) is an extension of classic linear programming in which the decision vector varies within a set. In previous studies in the neural network community, such a set is often assumed to be a box set. In the paper, the ELP problem with a general polyhedral set is investigated, and three recurrent neural networks are proposed for solving the problem with different types of constraints classified by the presence of bound constraints and equality constraints. The neural networks are proved stable in the Lyapunov sense and globally convergent to the solution sets of corresponding ELP problems. Numerical simulations are provided to demonstrate the results.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Dantzig, G.B.: Linear Programming and Extensions. Princeton Univ. Press, Princeton (1980)

    Google Scholar 

  2. Maa, C.-Y., Shanblatt, M.A.: Linear and Quadratic Programming Neural Network Analysis. IEEE Trans. Neural Networks 3, 580–594 (1992)

    Article  Google Scholar 

  3. Wang, J.: A Deterministic Annealing Neural Network for Convex Programming. Neural Networks 7, 629–641 (1994)

    Article  MATH  Google Scholar 

  4. Xia, Y., Wang, J.: A Projection Neural Network and Its Application to Constrained Optimization Problems. IEEE Trans. Circuits Syst. I-Regul. Pap. 49, 447–458 (2002)

    Article  MathSciNet  Google Scholar 

  5. Forti, M., Nistri, P., Quincampoix, M.: Generalized Neural Network for Nonsmooth Nonlinear Programming Problems. IEEE Trans. Circuits Syst. I-Regul. Pap. 51, 1741–1754 (2004)

    Article  MathSciNet  Google Scholar 

  6. He, B.: Solution and Applications of a Class of General Linear Variational Inequalties. Science in China, Ser. A 39, 397–404 (1996)

    Google Scholar 

  7. Xia, Y.: Neural Network for Solving Extended Linear Programming Problems. IEEE Trans. Neural Networks 8, 803–806 (1997)

    Article  Google Scholar 

  8. Gao, X.: A Neural Network for a Class of Extended Linear Variational Inequalities. Chinese Journal of Electronics 10, 471–475 (2001)

    Google Scholar 

  9. Kinderlehrer, D., Stampcchia, G.: An Introduction to Variational Inequalities and Their Applications. Academic Press, New York (1980)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, X., Wang, J. (2006). Solving Extended Linear Programming Problems Using a Class of Recurrent Neural Networks. In: King, I., Wang, J., Chan, LW., Wang, D. (eds) Neural Information Processing. ICONIP 2006. Lecture Notes in Computer Science, vol 4233. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11893257_109

Download citation

  • DOI: https://doi.org/10.1007/11893257_109

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46481-5

  • Online ISBN: 978-3-540-46482-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics