Noun
dynamic programming (uncountable)
(mathematics, computer science) An optimization method by which a problem having optimal substructure is recursively broken into simpler subproblems which are solved to produce the globally optimal solution.
S. Martello, D. Pisinger, P. Toth, Dynamic programming and strong bounds for the 0-1 knapsack problem, Manag. Source: Internet
Recursive optimization Dynamic programming is an approach to optimization that restates a multiperiod or multistep optimization problem in recursive form. Source: Internet