Dynamic Programming

Burley, T. A.; O’Sullivan, G.

doi:10.1007/978-1-349-08157-8_9

T. A. Burley² &
G. O’Sullivan²

Part of the book series: Macmillan Master Series ((MACMMA))

24 Accesses

Abstract

Dynamic programming is a method which has been developed to solve complex problems by using a simplifying procedure. It has many applications in business, notably to problems involving sequences of decisions in such areas as production planning, stock control, component and equipment maintenance and replacement, allocation of resources, and process design and control. The simplifying procedure significantly reduces the computational effort required.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Notes

R.E. Bellman and S. Dreyfuss, Applied Dynamic Programming (Princeton: Princeton UP, 1962).
Google Scholar

Download references

Author information

Authors and Affiliations

Department of Mathematics and Statistics, City of Birmingham Polytechnic, UK
T. A. Burley & G. O’Sullivan

Authors

T. A. Burley
View author publications
You can also search for this author in PubMed Google Scholar
G. O’Sullivan
View author publications
You can also search for this author in PubMed Google Scholar

Copyright information

About this chapter

Cite this chapter

Burley, T.A., O’Sullivan, G. (1986). Dynamic Programming. In: Work Out Operational Research. Macmillan Master Series. Palgrave, London. https://doi.org/10.1007/978-1-349-08157-8_9

Download citation

DOI: https://doi.org/10.1007/978-1-349-08157-8_9
Publisher Name: Palgrave, London
Print ISBN: 978-0-333-39618-6
Online ISBN: 978-1-349-08157-8
eBook Packages: Palgrave Business & Management CollectionBusiness and Management (R0)

Publish with us

Policies and ethics