第一步不考虑变量的整数约束，用修正单纯形法求解，由此可确定一部分线路是否需要建设。
The revised simplex method is used at first to calculate the optimal line extensions without integer constraints of the variables so that it can be determined which lines should be constructed.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
通过把模型中模糊机会约束清晰化，将模型转化为确定性的混合整数规划模型。
The model was transformed into a deterministic mixed integer linear planning(MILP) model by converting fuzzy chance constraints to their respective crisp equivalents.
以水源-水阱匹配关系为约束条件，建立了单杂质用水网络的混合整数线性规划模型。
The mixed integer linear programming model was established with the water source-sink matching as the constraint.
提出了一种新的蚁群算法来求解无约束的整数规划问题。
A new ACO algorithm for unconstrained nonlinear integer optimization problem is present.
此类规划问题包含有大量的整数规划及非线性约束，因而被广泛认为是一类NP难题。
Because the planning problem includes integral constrains and nonlinear constrains, it is always a NP hard problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
首先分析了弱顶点覆盖集的约束关系，并给出了问题的整数规划形式。
Firstly the constraints of weak vertex cover set are analyzed and the integer programming formulation for it is given.
设计了求解车辆路径问题一种新的整数编码方案，并采用罚函数法处理约束条件。
A new integer-code method is adopted for the vehicle routing problem, and strained terms in VRP are processed by the penalty function.
对一有界约束非线性混合整数规划问题进行了研究。
The problem of bounded nonlinear mixed integer programming is studied.
配电网络重构是在满足各种运行约束条件下，以网损最小或供电可靠性最高为目标，它是一个典型的非线性整数组合优化问题，常规的数学优化方法难以求解。
The purpose of distribution network reconfiguration is to obtain the minimum network loss and the maximum reliability while meeting all kinds of operational restrictions.
给出了具有频道负荷约束的专用移动无线电网络问题的整数线性规划，设计了求解特殊网络的具有频道负荷约束的频道分配问题的多项式时间算法。
An integer programming formulation for channel assignment problem with channel loading is presented and polynomial time algorithms are designed for some special radio networks in this paper.
本文考虑冬季道路养护中的服务水平、车队规模等约束条件，建立了实习信息下除雪车辆优化调度的整数规划模型。
This paper established an integer programming model of the snow emergency vehicle scheduling which considered the realistic constraints such as the fleet size and the level of service.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
应用推荐