电力系统机组组合问题是一个典型的大规模混合整数的非线性组合优化问题，很难得到理论上的最优解。

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.

youdao

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

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

youdao

“分支”为整数规划最优解的出现创造了条件，而“定界”则可以提高搜索的效率。

"Branching step" has created the condition for the integer linear programming appearance, but "bounding step" may enhance the search the efficiency.

youdao