| 释义 |
mathematical programming
数学规划
1. In operations research, a procedure for locating the maximum or minimum of a function subject to constraints.
在运筹学中,找出受约束函数的最大值或最小值的 过程。对照convex programming, dynamic programming, integer programming, linear programming, nonlinear programming, quadratic programming。
2. The construction of source programs using an autocode or other numerical code.
采用自动代码或其它数字代码构造源程序的过程。 |