The significant failure models are identified by using the modified branch and bound method.
用改进的分枝限界法判认主要失效模式。
Numerical experiments showed that the branch and bound method with these techniques was effective.
实验表明,基于这些结果所构造的分支定界算法是有效的。
The model is calculated by applying multi-target programming theory as well as branch and bound method.
运用多目标规划理论与分枝定界法对模型进行求解。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法,建立了非线性整数规划模型。
We first provide a lower bound of its optimal value which can be used to solve the problem optimally by branch and bound method.
该文首先给出一个最优解值的下界估计,它可用于分枝定界法求最优解。
At last, the thesis proves MILP model and its arithmetic-branch and bound method practicability and validity by giving an example.
最后,本文运用例子证明了混合整数线性规划及其算法-分枝定界法的实用性和有效性。
In this paper, the problem for contract processing sequencing with penalty factor is studied and a branch and bound method for this problem is proposed.
本文研究了具有惩罚因子的合同加工排序问题,提出了相应的分枝定界算法。
In the branch and bound method for solving non-convex programming, the choice of region subdivision directly affects the convergence of the whole algorithm.
在求解非凸规划的分枝定界法中,剖分区间的选取直接影响到整个算法的收敛速度。
In this pater, the problem of limited resources and shortest time limit for a project is studied and an algorithm of branch and bound method for this problem is proposed.
本文研究了资源有限—工期最短的优化问题,提出了相应的分枝定界算法。
Based on the general principle of the branch-and-bound method, the branching rule and the bounding calculating method to solve this problem are proposed.
根据分枝一定界法的基本原理,提出了解决该问题的分枝规则及其定界计算的方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题,给出了一个分枝定界方法。
In this paper, a branch-and-bound method is proposed for non-convex quadratic programming problems with convex constrains.
针对凸约束非凸二次规划问题,给出了一个分枝定界方法。
应用推荐