Skip to main content

Advertisement

Log in

Book reviews

  • Published:
Policy Sciences Aims and scope Submit manuscript

Abstract

Professor Jay W. Forrester's book, Urban Dynamics, is an important, but controversial, contribution in the area of computer simulation of urban problems. This article presents a critical examination of this book.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. Bellman, R. E., Dynamic Programming. Princeton, N.J.: Princeton Univ. Press, 1957.

    Google Scholar 

  2. Bellman, R. E., S. E. Dreyfus, Applied Dynamic Programming. Princeton, N.J.: Princeton Univ. Press, 1962.

    Google Scholar 

  3. Howard, R. A., Dynamic Programming and Markov Processes, New York: Technology Press and Wiley, 1960.

    Google Scholar 

  4. Nemhauser, G. L., Introduction to Dynamic Programming. New York: Wiley, 1966.

    Google Scholar 

  5. Kaufmann, A., and R. Cruon, Dynamic Programming: Sequential Scientific Management. New York: Academic Press, 1967. (Originally published in French by Dunod, Paris, 1965.)

    Google Scholar 

  6. Larson, R. E., State Increment Dynamic Programming. New York: American Elsevier, 1968.

    Google Scholar 

  7. Dreyfus, S. E., Dynamic Programming and the Calculus of Variations. New York: Aca- demic Press, 1965.

    Google Scholar 

  8. Hadley, G., Nonlinear and Dynamic Programming, Reading, Mass.: Addison-Wesley, 1964.

    Google Scholar 

  9. Tou, J. T., Modern Control Theory, Chapter 7. New York: McGraw-Hill, 1964.

    Google Scholar 

  10. Wilde, D. J., and C. S. Beightler, Foundations of Optimization, Chapter 8. Englewood Cliffs, N.J.: Prentice-Hall, 1967.

    Google Scholar 

  11. Pierre, D. A., Optimization Theory with Applications, Chapter 7. New York: Wiley, 1969.

    Google Scholar 

  12. Larson, R. E., “Dynamic Programming with Reduced Computational Requirements,” IEEE Trans. on Automatic Control, AC-10, April 1965, pp. 135–143.

  13. Larson, R. E., “An Approach to Reducing the High-Speed Memory Requirement of Dynamic Programming,” Jour. Math. Anal. and Appl. 11 (July 1965), 519–537.

    Google Scholar 

  14. Pontryagin, L. S., V. G. Boltyanskii, R. V. Gamkrelidze, and E. F. Mishchenko, The Mathematical Theory of Optimal Processes. New York: Interscience, 1962.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Weinblatt, H., Roberts, G.K., Tabak, D. et al. Book reviews. Policy Sci 1, 377–394 (1970). https://doi.org/10.1007/BF00145219

Download citation

  • Issue Date:

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

Navigation