In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.

在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。

youdao

Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.

用户可以选择使用非线性规划的方法或者几种分枝定界方法来满足他们对于精度和速度方面的不同需求。

youdao

The static planning constructs the mixed integer programming model . A branch exchange technique based on the change base of linear programming solves the model effectively.

静态规划建立了混合整数规划模型， 利用基于线性规划换基运算的支路交换法有效地求解该模型。

youdao