The Art and Theory of Dynamic Programming (Enhanced Edition‪)‬

Dynamic programming is an optimization procedure that is
particularly applicable to problems requiring a sequence of interrelated
decisions. Each decision transforms the current situation into a new
situation. A sequence of decisions, which in turn yields a sequence of
situations, is sought that maximizes (or minimizes) some measure of value.
The value of a sequence of decisions is generally equal to the sum of the
values of the individual decisions and situations in the sequence.