Learn Programming

Understanding Dynamic Programming

Dynamic programming is a mathematical technique that is usually used to make a decision on a series of interrelated decisions. In this case the dynamic program provides a systematic procedure to determine the optimal combination of decisions. The main purpose of this model is to facilitate the completion of optimization problems which have certain characteristics.

Unlike linear programming, there is no standard form for the mathematical formulation of dynamic programming. However, dynamic programming is a common approach to solving certain problems and equations used in it should be set up according to the situation of the problems encountered.

Dynamic programming is divided into dynamic programming and probabilistic deterministic. Characterized by deterministic dynamic programming where the next stage is determined entirely by the circumstances or decisions at this stage. While the probabilistic dynamic programming is characterized by where the next stage has a certain probability distribution.