随后又从中央计划者角度求解一个动态最优化问题，发现社会最优和竞争性均衡是一致的。
Solving a dynamic programming problem of a central planner can prove that the competitive equilibrium and the social optimum is identical.
但是动态编程通常被用于最优化问题(比如本文后面的示例)，而不是像斐波纳契数这样的问题。
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.
样条方法是当前自由曲线曲面造型最为常用的方法，动态规划为解决离散最优化问题的有效手段。
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.
现在，当我们讨论，动态编程中的最优化问题时，我想说有两件事需要注意。
Now, when we talked about optimization problems in dynamic programming, I said there were two things to look for.
本文引述了动态规划中的最优化原则和一些有关单变量和多变量问题的求解方法。
In this article, we introduce the principle of optimality in dynamic programming and some methods for solving certain simple variable and multi-variable problems.
本文分析了GIS环境下动态路径优化算法的特点，对GIS环境下城市路网的最优路径选择问题的关键技术进行了研究和验证。
This paper analyses some characters of dynamic path optimum algorithm, studies and verifies the key techniques of the optimum path of city road network under GIS.
这种建立模型的思想还可以应用到需要计算海森矩阵的动态无功优化、最优潮流以及状态估计等问题的算法中，以提高其计算速度。
This proposed modeling idea can also be applied to dynamic reactive optimization, optimal power flow and state estimation for a faster calculation.
炼钢厂的均衡，连续作业是十分重要的问题。本文首先利用动态规划最优化原理对该问题作了一般性分析。
By means of the optimality principles of the dynamic programming, this paper has given a general analysis of the coordination and the continual operation in a steel mill.
针对普通粒子群优化算法难以在动态环境下有效逼近最优位置的问题，提出一种动态粒子群优化算法。
Aiming at the problem that normal Particle Swarm Optimization (PSO) algorithm can not approach the best position effectively in dynamic environment, this paper proposes a dynamic PSO algorithm.
结合旅行商问题、二次指派问题以及网络路由问题等典型组合优化问题，概述了ACO在静态组合最优化和动态组合优化问题中的应用。
The applications of ACO to static and dynamic COPs, such as traveling salesman problem, quadratic assignment problem, network routing problem are reviewed.
对该复杂系统最优化问题，提出了各时段叶片安放角正交试验选优、水泵转速动态规划模型优化的试验选优方法。
To optimize this complicated system, we put forward a method that optimizes the setting angle by orthogonal experiment and the pump speed by dynamic programming.
对该复杂系统最优化问题，提出了各时段叶片安放角正交试验选优、水泵转速动态规划模型优化的试验选优方法。
To optimize this complicated system, we put forward a method that optimizes the setting angle by orthogonal experiment and the pump speed by dynamic programming.
应用推荐