مقایسهٔ روش‌ها

	برنامه‌ریزی پویای سناریوی خط‌مشی	برنامه‌ریزی پویا
حوزه	شبیه‌سازی	بهینه‌سازی
خانواده	Process / pipeline	Process / pipeline
سال پیدایش	1957	1957
پدیدآور	Bellman, Richard E.	Richard Bellman
نوع	Sequential optimization with scenario branching	Exact combinatorial optimization via recursive decomposition
منبع بنیادین	Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. ISBN: 9780691079516	Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6
نام‌های دیگر	PSDP, Policy-Scenario DP, Scenario-Based Dynamic Programming, Policy DP	DP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
مرتبط	5	3
خلاصه	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.	Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.