You saw how to analyze glpsol output for the integer problem.
我们学习了如何分析整型问题的glpsol输出结果。
Just know that the optimal solution for a non-integer problem is always one of the polyhedron vertices.
我们只需要知道非整型问题的优化解决方案通常都是一个多面体的顶点就好了。
Thus, a relaxation of the constraint of an integer problem does not necessarily improve the solution, because the feasible region is discrete and not continuous.
因此，整型问题的约束放松并不一定会改进解决方案，因为可行域是离散的，而不是连续的。
Finally, I discussed feasible region visualization for an integer problem and the way it relates to the objective function for an integer and for the corresponding relaxed problem.
最后，我们讨论了整型问题的可行域的可视化问题，以及整型和相关放松限制问题的目标函数的处理方法。
In most situations this does not pose a problem but for the translation of an IDL unsigned integer type whose value falls inside the number range of its highest order bit there will be a mismatch.
在多数情况下这不会发生问题，但是当一个IDL无符号整数取值正好落在最高位所限制的取值范围中时，类型转换就会发生不匹配的错误。
A mixed integer programming formulation for the off-line version of the problem has been proposed.
给出了问题的数学描述，并对其静态问题，构造了一个混合整数规划模型。
In other words, the feasible region is not a polyhedron; it's composed only of the integer (x1, x2,..., xn) pairs inside or at the boundaries of the actual polyhedron of the relaxed problem.
换而言之，可行域不是一个多面体；它是由这个多面体或放松限制问题的实际多面体边界中的一些整数(x1、x 2、…、xn)对。
The process of which is to solve the integer programming problem with the objective function that RMSE is minimal.
选择最优参数的过程即是对以均方根误差最小为目标的整数规划问题的求解过程。
The post office problem introduced MathProg expressions and integer-only decision variables.
邮局问题中引入了MathProg表达式和只使用整型的决策变量。
It is to understand the basis for other integer programming problem.
它是理解其它整数规划问题的基础。
Listing 6. glpsol output for the integer-constrained post office problem.
清单6 . glpsol对整型约束邮局问题的输出结果。
The master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
Integer Programming is a famous NP hard problem. This paper presents a new algorithm, in which the method of similar dimidiate is adopted.
整数规划是NP困难的经典问题之一，将传统的二分搜索方法推广应用到整数规划的解空间中，提出一种求解整数规划的新算法。
The scheduling is formalized as a integer programming problem.
该描述将调度问题形式化为整数规划问题。
Integer ambiguity resolution is the key problem of GPS based real-time attitude determination system which use double differencing carrier phase observables.
GPS姿态测量通常采用双差载波相位观测量，因此整周模糊值解算成为GPS实时姿态测量的关键问题。
Then, the fuzzy set-covering model is transformed to a 0-1 integer planning problem through fuzzy set operation and operator transformation.
通过模糊集合运算与算子变换把模糊数学模型最终转化为一个0-1整数规划问题。
According to the standard form of MID system, the problem of mixed integer quadratic programming (MIQP) and its mathematics description can be obtained.
根据混合逻辑动态系统的标准形式，转化为混合整数二次规划(MIQP)的问题，同时获得它的数学描述。
This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management.
对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。
Distribution network planning is a nonlinear mixed integer program problem which is usually difficult to be solved by conventional optimization algorithm.
配电网络规划属于非线性混合整数规划问题，应用传统数学优化算法往往难以直接求解。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
We will show that the traditional mixed integer programming approach makes the problem difficult to represent and solve.
我们将说明传统的混合整数规划方法使问题难以描述和解决。
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.
同时，从理论上来讲，该模型适合含有任意变量的任意0-1整数规划问题的求解。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
Three rules are put forward for simplifying the DCPM problem based on the first decision network, and a new integer programming model is developed for solving the problem.
对以第一种网络为基础的DCPM问题，本文首先介绍了三条简化法则，然后建立了一个求最优解的新整数规划模型；
Model checking based on decision diagram causes memory explosion in integer multiplier verification. An efficient solution to this problem is backward substitution method.
采用基于决策图的模型检验方法对整数乘法器验证时会出现内存爆炸，解决该问题的一种有效途径是采用反向替换方法。
In this paper, we consider a special integer bottleneck problem, and present two polynomial algorithms.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
The HEWC problem was formulated as an integer linear program, and an approximation solution was obtained by using LP-relation and rounding heuristic.
HEWC问题第一次被归结为一个整数线性规划问题，并且利用LP的放松问题和有界启发得到一个近似解。
Results An multiobjective programing model based on integer programming for ASA problem is established, which serves as the foundation for later researches on optimizing algorithms.
结果建立起了ASA问题的一个多目标整数规划模型，为后续优化算法研究奠定了基础。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
The model is based on "Branch Bound" method which is used to solving the problem of integer linear programming, and it has the characters of parallel computing, goal driving and less time complicacy.
该模型基于求解整数线性规划问题的分枝定界方法，具有求解并行、目标驱动、时间复杂性低等特点。
应用推荐