Comparar métodos
Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.
| Programação Dinâmica por Cenários de Política× | Programação Dinâmica Estocástica× | |
|---|---|---|
| Área | Simulação | Simulação |
| Família | Process / pipeline | Process / pipeline |
| Ano de origem | 1957 | 1957 |
| Autor original≠ | Bellman, Richard E. | Bellman, R.; formalized for stochastic settings by Puterman, M. L. |
| Tipo≠ | Sequential optimization with scenario branching | Sequential optimization under uncertainty |
| Fonte seminal | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780486428093 |
| Outros nomes | PSDP, Policy-Scenario DP, Scenario-Based Dynamic Programming, Policy DP | SDP, Markov Decision Process, MDP, Stochastic DP |
| Relacionados≠ | 5 | 6 |
| Resumo≠ | Policy Scenario Dynamic Programming (PSDP) applies Bellman's recursive optimization framework to a set of pre-specified policy scenarios, enabling decision-makers to compare staged, sequential decisions under distinct future conditions. It decomposes a complex, multi-period policy choice into tractable sub-problems solved backward through time, yielding optimal action sequences for each scenario and a structured basis for scenario comparison. | 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. |
| ScholarGateConjunto de dados ↗ |
|
|