Skip to main content
Log in

Gambling and curve-fitting problems using dynamic programming

  • Contributed Papers
  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

In this paper, a racehorse problem and related problems are solved using dynamic programming. A special curve-fitting problem is discussed, and a method for solution is given. The treatment throughout is elementary and gives a fundamental discussion of dynamic programming with respect to a certain class of functional equations.

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.

Similar content being viewed by others

References

  1. Bellman, R. E.,Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1957.

    Google Scholar 

  2. Vajda, S.,Mathematical Programming, Addison-Wesley Publishing Company, Reading, Massachusetts, 1961.

    Google Scholar 

  3. Kaufmann, A.,Graphs, Dynamic Programming, and Finite Games, Academic Press, New York, 1967.

    Google Scholar 

  4. Davis, P. J.,Interpolation and Approximation, Blaisdell Publishing Company, Waltham, Massachusetts, 1963.

    Google Scholar 

  5. Bellman, R. E., andDreyfus, S.,Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1961.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by S. E. Dreyfus

Rights and permissions

Reprints and permissions

About this article

Cite this article

Baldwin, J.F. Gambling and curve-fitting problems using dynamic programming. J Optim Theory Appl 9, 367–378 (1972). https://doi.org/10.1007/BF00934737

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation