具有等式约束的LP的对称群及其在正交表分类中的应用
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays
摘要:
对于给定的线性规划(LP),将可行点发送到可行点并保持其每个可行点的目标函数值的变量的置换是LP的对称性。LP的所有对称的集合,记为$G^{\rm LP}$,是LP的对称群。Margot [F. Margot,50 Years整数规划1958-2008(2010),647-686]描述了一种用于计算LP的对称群$G^{\rm LP}$的子群的方法。该方法在线性规划只有非冗余不等式且其可行集不满足等式约束的情况下计算$G^{\rm LP}$。然而,当LP的可行集满足等式约束时,该方法仅找到$G^{\rm LP}$的子群,并且可能错过对称性。我们发展了一种方法来寻找对称群的可行LP的可行集满足等式约束。我们应用这种方法来寻找和利用以前未利用的对称性的正交阵列定义整数线性规划(ILP)内的分支和界限(B\&B)与同构修剪算法[F。Margot,对称ILP:着色和小整数,离散最优化4(1)(2007),40-62]。与已知的最快的方法相比,我们的方法将查找OA $(160,8,2,4)$和OA $(176,8,2,4)$的所有OD等价类的运行时间减少了$1/(2.16)$和$1/(1.36)$的因子[D. A. Bulutoglu和K. J. Ryan,正交数组分类的整数规划,Australasian Journal of Combinatorics 70(3)(2018),362-385]。这是两个瓶颈的情况下,不能得到解决,直到B\&B同构修剪算法的应用。
英文摘要:
For a given linear program (LP) a permutation of its variables that sends feasible points to feasible points and preserves the objective function value of each of its feasible points is a symmetry of the LP. The set of all symmetries of an LP, denoted by $G^{\rm LP}$, is the symmetry group of the LP. Margot [F. Margot, 50 Years of Integer Programming 1958-2008 (2010), 647-686] described a method for computing a subgroup of the symmetry group $G^{\rm LP}$ of an LP. This method computes $G^{\rm LP}$ when the LP has only non-redundant inequalities and its feasible set satisfies no equality constraints. However, when the feasible set of the LP satisfies equality constraints this method finds only a subgroup of $G^{\rm LP}$ and can miss symmetries. We develop a method for finding the symmetry group of a feasible LP whose feasible set satisfies equality constraints. We apply this method to find and exploit the previously unexploited symmetries of an orthogonal array defining integer linear program (ILP) within the branch-and-bound (B\&B) with isomorphism pruning algorithm [F. Margot, Symmetric ILP: Coloring and small integers, Discrete Optimization 4 (1) (2007), 40-62]. Our method reduced the running time for finding all OD-equivalence classes of OA$(160,8,2,4)$ and OA$(176,8,2,4)$ by factors of $1/(2.16)$ and $1/(1.36)$ compared to the fastest known method [D. A. Bulutoglu and K. J. Ryan, Integer programming for classifying orthogonal arrays, Australasian Journal of Combinatorics 70 (3) (2018), 362-385]. These were the two bottleneck cases that could not have been solved until the B\&B with isomorphism pruning algorithm was applied.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。