Solving a dynamic programming problem of a central planner can prove that the competitive equilibrium and the social optimum is identical.

随后又从中央计划者角度求解一个动态最优化问题，发现社会最优和竞争性均衡是一致的。

youdao

It combines an interface and a programming language into a dynamic tool for both numerical and symbolic problem solving.

它在一个动态工具中组合了界面和编程语言，可同时用于数字和符号问题的解答。

youdao

But dynamic programming is usually applied to optimization problems like the rest of this article's examples, rather than to problems like the Fibonacci problem.

但是动态编程通常被用于最优化问题(比如本文后面的示例)，而不是像斐波纳契数这样的问题。

youdao

So when you're trying to think about is this a problem that I can solve with dynamic programming, these are the two questions you ask.

所以当你想知道能否,用动态编程来解决这个问题时,你可以问自己两个问题。

麻省理工公开课 - 计算机科学及编程导论课程节选