ScholarGate
助手

方法对比

并排查看您选择的方法;存在差异的行会高亮显示。

随机动态规划×蒙特卡洛模拟×
领域仿真决策
方法族Process / pipelineMCDM
起源年份19571949
提出者Bellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
类型Sequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
开创性文献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 ↗
别名SDP, Markov Decision Process, MDP, Stochastic DP
相关60
摘要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.
ScholarGate数据集
  1. v1
  2. 2 来源
  3. PUBLISHED
  1. v1
  2. 1 来源
  3. PUBLISHED

前往搜索 下载幻灯片

ScholarGate方法对比: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. 于 2026-06-17 检索自 https://scholargate.app/zh/compare