方法证据记录

Multi-objective dynamic programming

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.

Sources recorded, not reviewed

源记录

引文逐字复制自方法源记录。这些引文不代表任何层级的验证。

Multi-Objective Dynamic Programming

分类方法记录 · process-pipeline / simulation

Bellman, R. (1957). Dynamic Programming. Princeton University Press, Princeton, NJ. · ISBN 9780691079516
Daellenbach, H. G., & Flood, R. L. (1992). Multi-objective dynamic programming. European Journal of Operational Research, 56(2), 215-225. · URL

打开完整方法

精选声明

声明已持久化到证据分类账中，每个声明都有自己的评估。

尚无精选声明

当分类账中没有声明时，此视图不会自行创建声明评估。

相关方法

从方法图中生成，显示为机器建议的关系 — 不推断任何证据声明。

Same method familyDynamic Programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMulti-objective genetic algorithmmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMulti-objective linear programmingmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketMulti-Objective Optimizationmachine-suggested · Relational suggestion, not evidence.Taxonomic bucketStochastic Dynamic Programmingmachine-suggested · Relational suggestion, not evidence.