3 ms·
Again, if the term linear programming makes sense for linear optimization problems, then the term dynamic makes sense for time dependent ones. Also: the core o
by Certhas 1y ago
Again, if the term linear programming makes sense for linear optimization problems, then the term dynamic makes sense for time dependent ones.
Also: the core of dynamic programming is breaking down a global optimization problem into many interacting local pieces. The Bellmann equation, which is the core mathematical result of dynamic programming, features neither recursion nor memoization.
- HarHarVeryFunny 1y agoOK, although that seems to be a different (maybe more thoughtful!) use of the term "dynamic programming". It reminds also of "blackboard-based" AI systems where a bunch of cooperating agents with different capabilities jointly work on a problem by posing sub-problems and sharing them on a common blackboard where other agents can grab them and post a solution back on the board.
- Certhas 1y agoLook at the Wikipedia article on dynamic programming. They are very much related. My impression is that the deep part of the math of dynamic programming, the decomposition into interrelated subproblems, is trivial in the CS text book examples. Then all that's left are implementation aspects.