ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

Pemrograman Dinamis Stokastik×Simulasi Monte Carlo×
BidangSimulasiPengambilan Keputusan
KeluargaProcess / pipelineMCDM
Tahun asal19571949
PencetusBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TipeSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
Sumber perintisBellman, 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
Terkait60
RingkasanStochastic 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 data
  1. v1
  2. 2 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Diakses 2026-06-15 dari https://scholargate.app/id/compare