dynamic programming
noun1
- 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.
- The advantage of dynamic programming as a procedure for solving optimization problems is the simplification obtained by decomposition. — 1975