这篇论文基于 Gomory 讨论双方法的复试“为整数编程问题,异议功能的增长作为一个枢变量在被允许决定搜索方向和 stepsize.Meanwhile 的解决方案的 scutting 飞机,我们采用当前的相等的脸技术以便格子在分离的不可分的脸被发现,更强壮的有效不平等容易被获得。
This paper discusses a re-examinatlon of dual methods based on Gomory's cutting plane for the solution of the integer programming problem, in which the increment of objection function is allowed as a pivot variable to decide the search direction and stepsize. Meanwhile, we adopt the current equivalent face technique so that lattices are found in the discrete integral face and stronger valid inequalities are acquired easily.