Skip to main content

Maximal displacement of discrete loaded strings

  • Discrete Optimization And Optimization In Networks
  • Conference paper
  • First Online:
System Modelling and Optimization

Part of the book series: Lecture Notes in Control and Information Sciences ((LNCIS,volume 143))

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.

References

  1. K. M. Chong, An induction theorem for rearrangements, Can. J. Math., 28(1976), 154–160.

    Google Scholar 

  2. K. M. Chong, A rearrangemnet inequality, Nanta Mathematica, 12(1979), 75–82.

    Google Scholar 

  3. F. B. Hildebrand, Finite Difference Equations and Simulations, Prentice Hall, Englewood Cliffs, N. J. 1968.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

H. -J. Sebastian K. Tammer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 International Federation for Information Processing

About this paper

Cite this paper

Cheng, SS. (1990). Maximal displacement of discrete loaded strings. In: Sebastian, H.J., Tammer, K. (eds) System Modelling and Optimization. Lecture Notes in Control and Information Sciences, vol 143. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0008399

Download citation

  • DOI: https://doi.org/10.1007/BFb0008399

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52659-9

  • Online ISBN: 978-3-540-47095-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics