ScholarGate
Asistent

Compară metode

Examinează metodele selectate una lângă alta; rândurile care diferă sunt evidențiate.

Programarea Dinamică Stocastică×Simulare Monte Carlo×
DomeniuSimulareLuarea deciziilor
FamilieProcess / pipelineMCDM
Anul apariției19571949
Autorul originalBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TipSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
Sursa seminalăBellman, 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 ↗
Denumiri alternativeSDP, Markov Decision Process, MDP, Stochastic DP
Înrudite60
RezumatStochastic 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.
ScholarGateSet de date
  1. v1
  2. 2 Surse
  3. PUBLISHED
  1. v1
  2. 1 Surse
  3. PUBLISHED

Mergi la căutare Descarcă prezentarea

ScholarGateCompară metode: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Preluat la 2026-06-17 de pe https://scholargate.app/ro/compare