Introduction - If you have any usage issues, please Google them yourself
Dynamic programming (programming dynamic) is a branch of operations research, and it is a mathematical method for solving decision (process). In 1950s, the American mathematician R.E.Bellman, principle process multistep (decision optimality), proposed the optimization problem of the multi stage decision process (of), the multi stage process is transformed into a series of single phase problem, and the relationship between each stage is solved.