Solving Decisioning Problems Sequentially over Time

Prof. Warren Powell wrote: “I recently came to the realization that all the motivating applications of linear programming used by Dantzig were in fact fully sequential (and stochastic). Which means, you do not just solve a single linear program – you have to solve them sequentially over time, where a decision at one point in time affects what you can do the next time you solve it.” A similar dynamic approach is true for various decisioning techniques. Link

This entry was posted in Decision Intelligence, Decision Optimization, Digital Transformation. Bookmark the permalink.

Leave a comment