ScholarGate
Asistente

Comparar métodos

Revisa los métodos seleccionados uno junto a otro; las filas que difieren aparecen resaltadas.

Programación Dinámica Estocástica×Simulación de Monte Carlo×
CampoSimulaciónToma de decisiones
FamiliaProcess / pipelineMCDM
Año de origen19571949
Autor originalBellman, R.; formalized for stochastic settings by Puterman, M. L.Metropolis, N., Ulam, S.
TipoSequential optimization under uncertaintyRobustness wrapper — Monte Carlo uncertainty propagation
Fuente seminalBellman, 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
Relacionados60
ResumenStochastic 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.
ScholarGateConjunto de datos
  1. v1
  2. 2 Fuentes
  3. PUBLISHED
  1. v1
  2. 1 Fuentes
  3. PUBLISHED

Ir a la búsqueda Descargar diapositivas

ScholarGateComparar métodos: Stochastic Dynamic Programming · MONTE-CARLO-SIMULATION. Recuperado el 2026-06-15 de https://scholargate.app/es/compare