Technical Note - The Use of Cuts in Complementary Programming
Technical Note - The Use of Cuts in Complementary Programming
复制标题
技术说明 - 补充编程中剪切的使用
DOI：
10.1287/opre.21.1.353
复制
发表时间：
1973
期刊：
影响因子：
--
通讯作者：
T. Ibaraki
中科院分区：
文献类型：
--
作者：
T. Ibaraki
互补规划问题是具有对每个指定对xp，xq的附加限制xpxq=0的线性规划问题。本文从约束xpxq=0得到称为C-割集的约束条件，并用它们来简化早期文献[OPNS]中提出的分支定界过程的计算。决议19,1523-1528 1971年]。文中还给出了一些计算结果。
A complementary programming problem is a linear programming problem with the additional restriction that xpxq = 0 holds for each specified pair xp, xq. This paper obtains constraints called C-cuts from the restriction xpxq = 0, and uses them to facilitate the computation of the branch-and-bound procedure proposed in an earlier paper [Opns. Res. 19, 1523-1528 1971]. Some computational results are also reported.