电力系统机组组合问题是一个典型的大规模混合整数的非线性组合优化问题，很难得到理论上的最优解。
Power system unit commitment, a problem of nonlinear commitment optimization with typical large-scale hybrid integers, is difficult to get an optimal solution in theory.
给出了一类整数规划问题有唯一最优解的充要条件。
The number of the most optimal solutions of this integer programming is determined.
“分支”为整数规划最优解的出现创造了条件，而“定界”则可以提高搜索的效率。
"Branching step" has created the condition for the integer linear programming appearance, but "bounding step" may enhance the search the efficiency.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
In this paper, we consider a special integer bottleneck problem, and present two polynomial algorithms.
利用单纯形法求解该线性规划问题，便可得到整数规划的最优解。
By using simplex method to solve the LP, the optimal solution of ILP can be obtained.
对以第一种网络为基础的DCPM问题，本文首先介绍了三条简化法则，然后建立了一个求最优解的新整数规划模型；
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.
在解决各类整数规划问题时，分支-切割法是一个非常成功的方法，并且它能保证给出一个最优解。
In this paper, we analyze the methods from two aspects, cutting planes and branching on the basis of branch-and-cut algorithms.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
研究了一个特殊的整数瓶颈问题并给出了两个求最优解的多项式算法程序。
A polynomial time algorithm for the scheduling problem of identical coupled-task jobs is presented in.
应用推荐