它是理解其它整数规划问题的基础。
It is to understand the basis for other integer programming problem.
否则，就称之为非线性整数规划问题。
Otherwise, the problem is called a nonlinear integer program.
该描述将调度问题形式化为整数规划问题。
The scheduling is formalized as a integer programming problem.
本文对其做适当改进，用于解凸整数规划问题。
In this paper it is improved appropriately and applied to the convex integer programming problems.
这个同解模型是整数规划问题，作者指出了解法。
After Simplification, the author finds that the model is an integer programming problem, and gives the method.
对一有界约束非线性混合整数规划问题进行了研究。
The problem of bounded nonlinear mixed integer programming is studied.
给出了一类整数规划问题有唯一最优解的充要条件。
The number of the most optimal solutions of this integer programming is determined.
提出了一种新的蚁群算法来求解无约束的整数规划问题。
A new ACO algorithm for unconstrained nonlinear integer optimization problem is present.
运算结果表明，该算法对于整数规划问题有很好的效果。
The experimental results show the advantageous of the advantageous performance of the algorithm in integer programming.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
如果问题中的所有函数都是线性的，那就是线性整数规划问题。
If all the functions are linear, the problem is of a linear integer program.
这些模型形成具有0—1变量和一般整型变量的大规模整数规划问题。
These models are large scale integer programmings with 0-1 variables and general integer variables.
整数规划问题为多维时，理论上可以用分枝定界方法与割平面方法求解。
When the integral program problem is multi dimensional, branch boundary method and cutting plane approach are applicable for solving the problem.
对一般的0 - 1整数规划问题提出了一种半自动化的DNA计算模型。
To general 0-1 Integer Programming problem problem, we present a semi-roboticized DNA computing model.
探讨了用线性规划的有效集法求解整数规划问题，称之为有效集割平面法。
In this paper, the Active Set cutting plane method for integer programming is derived from Active Set method of linear programming.
选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal.
通过模糊集合运算与算子变换把模糊数学模型最终转化为一个0-1整数规划问题。
Then, the fuzzy set-covering model is transformed to a 0-1 integer planning problem through fuzzy set operation and operator transformation.
本文提出一种求解优化数学模型，属于非线性整数规划问题的方法——逐次近似法。
In this paper, an optimal mathematical model solving method, the successive approximation method, of the nature of nonlinear integral programming problem is suggested.
同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。
The most merit of the model is its automatization characteristic, and the model fits to solve arbitrary 0-1 Integer Programming problem having arbitrary variable element.
对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management.
汽轮机系统和锅炉系统分别构成线性混合0 - 1整数规划问题和非线性规划问题。
The steam turbine system and the boiler system construct respectively an integral linear 0-1 problem and a non-linear problem.
对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
A current large scale LP model is developed for operation of complicated flood control system.
配电网络规划属于非线性混合整数规划问题，应用传统数学优化算法往往难以直接求解。
Distribution network planning is a nonlinear mixed integer program problem which is usually difficult to be solved by conventional optimization algorithm.
应用已有的极点理论，优化相伴凸组合的界并改进整数规划问题的目标函数及变量的界。
Assuming knowledge of extreme points, we develop bounds for associated convex combinations and improve bounds on the integer programming problems objective function and variables.
考虑一类整数规划问题，其诸局势效益值时序相互关联，且呈现小样本无明显统计特征。
This paper discusses a kind of integer planning problems, whose situation benefit values are some relational time series with little samples, and are not typical statistic properties.
针对一类非线性整数规划问题，通过构造直接离散搜索方向提出了一种十分有效的新算法。
This paper proposes an efficient new algorithm by construction of a direct discrete search direction for a class of nonlinear integer programming problems.
针对一类非线性整数规划问题，通过构造直接离散搜索方向提出了一种十分有效的新算法。
This paper proposes an efficient new algorithm by construction of a direct discrete search direction for a class of nonlinear integer programming problems.
应用推荐