| 释义 |
integer programming 整数规划 In operations research, a class of procedures for locating the maximum or minimum of a function subject to constraints, where some or all variables must have integer values. 在运筹学中,求带有某些约束条件的函数的最大值或最小值的一种过程。这里部分或全部 变量必须取整数值。同discrete programming。对照convex programming, dynamic programming, linear programming, mathematicalprogramming, nonlinear programming, quadratic programming。 |