In a multi-stage problem, each choice affects later options. Sequential decision-making treats these choices as an interconnected sequence to optimize, rather than as isolated steps. section 6.0
Dynamic programming addresses this structure by decomposing a complex problem into related subproblems, reusing their solutions, and combining them recursively. This approach requires smaller solutions to contribute consistently to larger ones. section 6.0


