Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Stokastisk dynamisk programmering× | Montecarlosimulering× | |
|---|---|---|
| Ämnesområde≠ | Simulering | Beslutsfattande |
| Familj≠ | Process / pipeline | MCDM |
| Ursprungsår≠ | 1957 | 1949 |
| Upphovsperson≠ | Bellman, R.; formalized for stochastic settings by Puterman, M. L. | Metropolis, N., Ulam, S. |
| Typ≠ | Sequential optimization under uncertainty | Robustness wrapper — Monte Carlo uncertainty propagation |
| Ursprungskälla≠ | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 | Metropolis, N., Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association DOI ↗ |
| Alias≠ | SDP, Markov Decision Process, MDP, Stochastic DP | — |
| Närliggande≠ | 6 | 0 |
| Sammanfattning≠ | 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. | MONTE-CARLO-SIMULATION (Monte Carlo Simulation — Stochastic uncertainty propagation through MCDM model) is a ranking multi-criteria decision-making (MCDM) method introduced by Metropolis, N., Ulam, S. in 1949. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result. |
| ScholarGateDatamängd ↗ |
|
|