This thesis applies dynamic programming principle to solve a nonlinear programming problem.
应用动态规划原理来解决一类非线性规划问题。
And the result shows that we can find the best strategy in taxis' scheduling in the limited network through the dynamic programming principle.
结果表明对于在有限网络中求解出租车调度可以通过该方案求出最优解。
First, in this algorithm, the condition expectation in the dynamic programming principle is replaced by projections on a finite set of functions.
首先通过构造一个函数的有限集替代动态规划中的条件期望,其次使用蒙特卡洛模拟和最小二乘法计算第一步中的值函数。
应用推荐