Chapter 9 Dynamic Programming

Dynamic programming is a useful mathematical technique for making a sequence of interrelated decisions. It provides a systematic procedure for determining the optimal combination of decisions. (Hillier 2012)

Dynamic programming is a general type of approach to problem solving, and the particular equations used must be developed to fit each situation. Therefore, a certain degree of ingenuity and insight into the general structure of dynamic programming problems is required to recognize when and how a problem can be solved by dynamic programming procedures. (Hillier 2012)

References

Hillier, Frederick S. 2012. Introduction to Operations Research. Tata McGraw-Hill Education.