Finally, the relationships between generalized set-valued variational inclusion problems and non-convexprogramming are studied.
最后研究了广义集值变分包含问题与非凸规划之间的关系。
2
In the branch and bound method for solving non-convexprogramming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
3
The problem of collision detection between a pair of convex objects is summed up a problem of non-linear programming with restrict conditions in this paper.