The Linear Programming Relaxation Permutation Symmetry Group of an Orthogonal Array Defining Integer Linear Program

Document Type


Publication Date



There is always a natural embedding of $S_{s}\wr S_{k}$ into the linear programming (LP) relaxation permutation symmetry group of an orthogonal array integer linear programming (ILP) formulation with equality constraints. The point of this paper is to prove that in the $2$ -level, strength- $1$ case the LP relaxation permutation symmetry group of this formulation is isomorphic to $S_{2}\wr S_{k}$ for all $k$ , and in the $2$ -level, strength- $2$ case it is isomorphic to $S_{2}^{k}\rtimes S_{k+1}$ for $k\geqslant 4$ . The strength- $2$ result reveals previously unknown permutation symmetries that cannot be captured by the natural embedding of $S_{2}\wr S_{k}$ . We also conjecture a complete characterization of the LP relaxation permutation symmetry group of the ILP formulation.


The "Link to Full Text" button on this page loads the open access article version of record, hosted at Cambridge University Press. The publisher retains permissions to re-use and distribute this article.

Reviewed at MR3507280



Source Publication

LMS Journal of Computation and Mathematics