Convex analysis, Lagrangian relaxation, non differentiable optimization, and applications in integer programming.

凸分析 、 拉格朗日松弛法 、 不可微分函数最适化以及在整数规划上的应用.

互联网

A kind of hybrid genetic algorithm for integer programming was proposed.

给出一种求解整数规划问题的混合遗传算法.

互联网

The only general solution is linear or integer programming.

唯一通行的解决方法是线性规划或者整数规划.

互联网

To general 0 - 1 Integer Programming Problem problem, we present a semi - roboticized DNA computing model.

对一般的0-1整数规划问题提出了一种半自动化的DNA计算模型.

互联网

Both models of nonlinear recursive programming and mixed integer programming for crude optimization were introduced.

介绍原油优选模型中的非线性递归模型和混合整数规划模型技术.

互联网

The approximate algorithm of a nonlinear bilevel integer programming for global optimization was discussed.

讨论了一类非线性两级整数规划全局优化的求解问题.

互联网

To develop a branch and bound method for this problem, a nonlinear integer - programming model was constructed.

为设计求解该问题的分支定界算法,建立了非线性整数规划模型.

互联网

The number of the most optimal solutions of this integer programming is determined.

给出了一类整数规划问题有唯一最优解的充要条件.

互联网