dynamic programming in Russian

(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.