Article ID: | iaor2004734 |
Country: | United States |
Volume: | 23 |
Issue: | 1 |
Start Page Number: | 61 |
End Page Number: | 68 |
Publication Date: | Feb 1998 |
Journal: | Mathematics of Operations Research |
Authors: | Cunningham W.H., Geelen J.F. |
Keywords: | programming: linear, matrices |
We characterize the class of integral square matrices M having the property that for every integral vector q the linear compelementarity problem with data M, q has only integral basic solutions. These matrices, called principally unimodular matrices, are those for which every principal nonsingular submatrix is unimodular. As a consequence, we show that if M is rank-symmetric and principally unimodular, and q is integral, then the problem has an integral solution if it has solution. Principal unimodularity can be regarded as an extension of total unimodularity, and our results can be regarded as extensions of well-known results on integral solutions to linear programs. We summarize what is known about principally unimodular symmetric and skew-symmetric matrices.