ScholarGate
Asistents

Salīdzināt metodes

Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.

Stochastic Dynamic Programming×Monte Carlo simulācija×
NozareSimulācijaLēmumu pieņemšana
SaimeProcess / pipelineMCDM
Izcelsmes gads19571949
AutorsBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TipsSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
PirmavotsBellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093Metropolis, N., Ulam, S. (1949). The Monte Carlo method. Journal of the American Statistical Association DOI ↗
Citi nosaukumiSDP, Markov Decision Process, MDP, Stochastic DP
Saistītās60
KopsavilkumsStochastic 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.
ScholarGateDatu kopa
  1. v1
  2. 2 Avoti
  3. PUBLISHED
  1. v1
  2. 1 Avoti
  3. PUBLISHED

Doties uz meklēšanu Lejupielādēt slaidus

ScholarGateSalīdzināt metodes: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Izgūts 2026-06-17 no https://scholargate.app/lv/compare