ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Pengaturcaraan Dinamik Stokastik×Simulasi Monte Carlo×
BidangSimulasiPembuatan Keputusan
KeluargaProcess / pipelineMCDM
Tahun asal19571949
PengasasBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
JenisSequential 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
Berkaitan60
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

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Dicapai 2026-06-15 daripada https://scholargate.app/ms/compare