A Dynamic Planning Technique for Continuous Activities Under Multiple Resource Constraints
提出一种将单纯形搜索算法融入动态规划递归计算的方法，缓解“维度灾难”，适用于含不可微或高度非线性性能函数的多资源分配问题，并在复杂问题中验证了多项式平均性能。
The solution technique developed in this paper integrates the simplex search algorithm into the recursive calculations of dynamic programming in order to mitigate the “curse-of-dimensionality.” Since differentiation is not required as a means of optimization procedure, it is expected that this technique will have an important impact on planning problems, such as the multiple resource allocation problems which involve nondifferentiable and/or highly nonlinear performance functions. Applications of the technique to very complex problems seem to confirm the anticipated polynomial average performance.