Consider a situation where decisions are made in stages. The outcome of each decision is not fully predictable but can be anticipated to some extent before the next decision is made. The objective is to minimize a certain cost - a mathematical expression of what is considered an undesirable outcome.
A key aspect of such situations is that decisions cannot be viewed in isolation since one must balance the desire for low present cost with the undesirability of high future costs. The dynamic programming technique captures this trade-off. At each stage, decisions are ranked based on the sum of the present cost and the expected future cost, assuming optimal decision making for subsequent stages.
This is a quote from Dynamic programming and optimal control by Bertsekas.
Can someone explain the meaning of the last paragraph. What is the trade-off here and how dynamic programming solves it ?