In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convex programming problems.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
Finally, the relationships between generalized set-valued variational inclusion problems and non-convex programming are studied.
最后研究了广义集值变分包含问题与非凸规划之间的关系。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中，剖分区间的选取直接影响到整个算法的收敛速度。
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.
将两凸物体间碰撞检测问题归结为一个带约束条件的非线性规划问题。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题，给出了一个分枝定界方法。
The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution.
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
The problem about how to determine the weak efficient solution of convex multiobjective programming is turned into a problem judge whether an equation has non-negative non-zero solution.
将弱有效解的判断问题转化为判断一线性方程组是否存在非负、非零解的问题。
应用推荐