ScholarGate
Assistent

Sammenlign metoder

Gennemgå dine valgte metoder side om side; rækker, der afviger, er fremhævet.

Stokastisk dynamisk programmering×Monte Carlo-simulering×
FagområdeSimuleringBeslutningstagning
FamilieProcess / pipelineMCDM
Oprindelsesår19571949
OphavspersonBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TypeSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
Oprindelig 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 ↗
AliasserSDP, Markov Decision Process, MDP, Stochastic DP
Relaterede60
Resumé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.
ScholarGateDatasæt
  1. v1
  2. 2 Kilder
  3. PUBLISHED
  1. v1
  2. 1 Kilder
  3. PUBLISHED

Gå til søgning Hent slides

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