Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Δυναμικός Προγραμματισμός Σεναρίων Πολιτικής× | Στοχαστικός Δυναμικός Προγραμματισμός× | |
|---|---|---|
| Πεδίο | Προσομοίωση | Προσομοίωση |
| Οικογένεια | Process / pipeline | Process / pipeline |
| Έτος προέλευσης | 1957 | 1957 |
| Δημιουργός≠ | Bellman, Richard E. | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| Τύπος≠ | Sequential optimization with scenario branching | Sequential optimization under uncertainty |
| Θεμελιώδης πηγή | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| Εναλλακτικές ονομασίες | PSDP, Policy-Scenario DP, Scenario-Based Dynamic Programming, Policy DP | SDP, Markov Decision Process, MDP, Stochastic DP |
| Συναφείς≠ | 5 | 6 |
| Σύνοψη≠ | Policy Scenario Dynamic Programming (PSDP) applies Bellman's recursive optimization framework to a set of pre-specified policy scenarios, enabling decision-makers to compare staged, sequential decisions under distinct future conditions. It decomposes a complex, multi-period policy choice into tractable sub-problems solved backward through time, yielding optimal action sequences for each scenario and a structured basis for scenario comparison. | Stochastic Dynamic Programming (SDP) is a mathematical optimization framework for sequential decision problems where outcomes are partly random. It extends Bellman's principle of optimality to stochastic environments, representing problems as Markov Decision Processes (MDPs) and computing optimal policies by solving recursive value equations over states and time periods. |
| ScholarGateΣύνολο δεδομένων ↗ |
|
|