ScholarGate
Assistent

Sammenlign metoder

Gjennomgå de valgte metodene side om side; rader som avviker, er uthevet.

Stochastic Dynamic Programming×Monte Carlo-simulering×
FagfeltSimuleringBeslutningstaking
FamilieProcess / pipelineMCDM
Opprinnelsesår19571949
OpphavspersonBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TypeSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
Opprinnelig kildeBellman, 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 ↗
AliasSDP, Markov Decision Process, MDP, Stochastic DP
Relaterte60
SammendragStochastic 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.
ScholarGateDatasett
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søk Last ned lysbilder

ScholarGateSammenlign metoder: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Hentet 2026-06-15 fra https://scholargate.app/no/compare