skip to main content
article

Dynamic Programming

Published: 01 January 1966 Publication History

Abstract

Dynamic programming is a mathematical technique for solving certain types of sequential decision problems. We characterize a sequential decision problem as a problem in which a sequence of decisions must be made with each decision affecting future decisions. We need to consider such problems because we rarely encounter an operational situation where the implications of any decision do not extend far into the future. For example, the best way to invest funds this year depends upon how the proceeds from this year's investments can be employed next year. The maintenance policy we should use for our machinery this year depends upon what we intend to do with this machinery in the future. The examples are as numerous as the fields of man's endeavor.

References

[1]
BELLMAN, R., Dynamic Programming, Princeton University Press, Princeton,. New Jersey, 1957.
[2]
BELLMAN, R. and DRETFUS, S., Applied Dynamic Programming, Princeton University Press, Princeton, New Jersey, 1962.
[3]
HOWARD, R., Dynamic Programming and Markov Processes, M. I. T. Press, Cambridge, Massachusetts, 1960.

Cited By

View all
  • (2021)Alleviating the independence assumptions of averaged one-dependence estimators by model weightingIntelligent Data Analysis10.3233/IDA-20540025:6(1431-1451)Online publication date: 1-Jan-2021
  • (2018)A Survey on Compiler Autotuning using Machine LearningACM Computing Surveys10.1145/319797851:5(1-42)Online publication date: 18-Sep-2018
  • (2017)Joint Virtual Network Function Selection and Traffic Steering in Telecom NetworksGLOBECOM 2017 - 2017 IEEE Global Communications Conference10.1109/GLOCOM.2017.8254652(1-7)Online publication date: 4-Dec-2017
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Management Science
Management Science  Volume 12, Issue 5
January 1966
178 pages

Publisher

INFORMS

Linthicum, MD, United States

Publication History

Published: 01 January 1966

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2021)Alleviating the independence assumptions of averaged one-dependence estimators by model weightingIntelligent Data Analysis10.3233/IDA-20540025:6(1431-1451)Online publication date: 1-Jan-2021
  • (2018)A Survey on Compiler Autotuning using Machine LearningACM Computing Surveys10.1145/319797851:5(1-42)Online publication date: 18-Sep-2018
  • (2017)Joint Virtual Network Function Selection and Traffic Steering in Telecom NetworksGLOBECOM 2017 - 2017 IEEE Global Communications Conference10.1109/GLOCOM.2017.8254652(1-7)Online publication date: 4-Dec-2017
  • (2012)Reinforcement learning approach to multi-stage decision making problems with changes in action setsArtificial Life and Robotics10.1007/s10015-012-0058-917:2(293-299)Online publication date: 1-Dec-2012
  • (1986)The Fastest Path through a Network with Random Time-Dependent Travel TimesTransportation Science10.5555/2726908.272691220:3(182-188)Online publication date: 1-Aug-1986
  • (1967)Minimum-Cost Checking Using Imperfect InformationManagement Science10.1287/mnsc.13.7.45413:7(454-465)Online publication date: 1-Mar-1967

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media