Bandingkan kaedah
Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.
| Policy Scenario Dynamic Programming× | Pengaturcaraan Dinamik Multi-Objektif× | |
|---|---|---|
| Bidang | Simulasi | Simulasi |
| Keluarga | Process / pipeline | Process / pipeline |
| Tahun asal≠ | 1957 | 1957-1975 |
| Pengasas≠ | Bellman, Richard E. | Extension of Bellman (1957); formalized by multiple authors from 1970s onward |
| Jenis≠ | Sequential optimization with scenario branching | Exact optimization — recursive multi-objective decomposition |
| Sumber perintis | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 | Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516 |
| Alias | PSDP, Policy-Scenario DP, Scenario-Based Dynamic Programming, Policy DP | MODP, Multi-criteria dynamic programming, Vector dynamic programming, Pareto dynamic programming |
| Berkaitan | 5 | 5 |
| Ringkasan≠ | 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. | Multi-Objective Dynamic Programming (MODP) extends Bellman's classical dynamic programming to settings where a decision-maker must optimize several competing objectives simultaneously across a sequence of stages. Rather than a single optimal policy, it produces a Pareto-optimal set of policies — each representing a distinct trade-off profile — by propagating vector-valued value functions backward through the state space. |
| ScholarGateSet data ↗ |
|
|