Abstract
Dynamic Programming, or dynamic optimization, is an optimization approach that simplifies complex problems by breaking them into smaller, interconnected subproblems. This method eliminates redundancy and significantly improves efficiency. DP finds practical applications in various real-world problems within Operations Research, enhancing decision-making processes. Its usefulness is shown by two examples with a practical application in Python.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Neifer, T., Lawo, D. (2024). Dynamic Programming. In: Peren, F.W., Neifer, T. (eds) Operations Research and Management. Springer Texts in Business and Economics. Springer, Cham. https://doi.org/10.1007/978-3-031-47206-0_11
Download citation
DOI: https://doi.org/10.1007/978-3-031-47206-0_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-47205-3
Online ISBN: 978-3-031-47206-0
eBook Packages: Business and ManagementBusiness and Management (R0)