What is the characteristic of problems that can be solved using dynamic programming?

The problem can be divided into stages where a decision policy is required at each stage.
Each stage has a certain number of associated states.
The decision made at any stage indicates how the state in the current stage is transformed into the state in the next stage.
The solution procedure is designed to find an optimal policy for the entire problem.
Given the current state, the optimal decision for each of the remaining stages should not depend on previously reached states.
The solution procedure starts by finding the optimal policy for the last stage.
There is a recursive relationship that indicates the optimal policy for stage (n+1).