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

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

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

样条方法是当前自由曲线曲面造型最为常用的方法，动态规划为解决离散最优化问题的有效手段。

B-spline is the most popular method to present free-form curve and surface, and DP algorithm is the effective approach for solving discrete optimization problems.

youdao

Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.

现在，当我们讨论,动态编程中的最优化问题时，我想说有两件事需要注意。

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