最后研究了广义集值变分包含问题与非凸规划之间的关系。
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.
文中对CHIP方法进行了改进并利用改进的方法去求解更大一类的非凸规划问题。
In this paper, they modify the CHIP method and use the modified one to solve a broader class of non-convex programming problems.
针对非凸规划，本文引进一简单的惩罚函数将其局部凸化，然后用凸规划的方法求解。
To the nonconvex programming, the article makes it local convexification by introducing a simple penalty function into the objective function, and solves it like solving convex programming.
基于解非线形规划的凸单纯形法，对一类线形分式规划的消耗系数矩阵进行灵敏度分析。
Based on the convex simplex method for nonlinear programming, a sensitivity analysis of consumption coefficient matrix in linear fractional programming is presented.
对束方法的研究涉及凸分析，线性和非线性规划，非光滑分析等数学分支。
Researches on bundle methods touch upon such mathematical branches as convex analysis, nonlinear programming and nonsmooth analysis.
利用组合极大熵同伦方法，研究一般的非凸非线性规划问题。
We utilized the combined maximum entropy homotopy method to solve the general nonconvex nonlinear programming problems.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
利用组合极大熵同伦方法，研究一般的非凸非线性规划问题。
In this paper, we present a new interior point method-combined homotopy interior point method.
利用组合极大熵同伦方法，研究一般的非凸非线性规划问题。
In this paper, we present a new interior point method-combined homotopy interior point method.
应用推荐