TY - JOUR

T1 - Total dual integrality of the linear complementarity problem

AU - Sumita, Hanna

AU - Kakimura, Naonori

AU - Makino, Kazuhisa

N1 - Funding Information:
Acknowledgements The authors thank the referees for their valuable comments on this manuscript. The first author is supported by JST ERATO Grant Number JPMJER1201, Japan, and JSPS KAKENHI Grant Numbers JP14J10346 and JP17K12646. The second author is supported by JSPS KAKENHI Grant Numbers JP25730001, JP24106002, and JP17K00028. The third author is supported by JSPS KAKENHI Grant Numbers JP24106002, JP25280004, JP26280001, and JST CREST Grant Number JPMJCR1402, Japan.
Funding Information:
The authors thank the referees for their valuable comments on this manuscript. The first author is supported by JST ERATO Grant Number JPMJER1201, Japan, and JSPS KAKENHI Grant Numbers JP14J10346 and JP17K12646. The second author is supported by JSPS KAKENHI Grant Numbers JP25730001, JP24106002, and JP17K00028. The third author is supported by JSPS KAKENHI Grant Numbers JP24106002, JP25280004, JP26280001, and JST CREST Grant Number JPMJCR1402, Japan.
Publisher Copyright:
© 2018, Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2019/3/15

Y1 - 2019/3/15

N2 - In this paper, we introduce total dual integrality of the linear complementarity problem (LCP) by analogy with the linear programming problem. The main idea of defining the notion is to propose the LCP with orientation, a variant of the LCP whose feasible complementary cones are specified by an additional input vector. Then we naturally define the dual problem of the LCP with orientation and total dual integrality of the LCP. We show that if the LCP is totally dual integral, then all basic solutions are integral. If the input matrix is sufficient or rank-symmetric, and the LCP is totally dual integral, then our result implies that the LCP always has an integral solution whenever it has a solution. We also introduce a class of matrices such that any LCP instance having the matrix as a coefficient matrix is totally dual integral. We investigate relationships between matrix classes in the LCP literature such as principally unimodular matrices. Principally unimodular matrices are known that all basic solutions to the LCP are integral for any integral input vector. In addition, we show that it is coNP-hard to decide whether a given LCP instance is totally dual integral.

AB - In this paper, we introduce total dual integrality of the linear complementarity problem (LCP) by analogy with the linear programming problem. The main idea of defining the notion is to propose the LCP with orientation, a variant of the LCP whose feasible complementary cones are specified by an additional input vector. Then we naturally define the dual problem of the LCP with orientation and total dual integrality of the LCP. We show that if the LCP is totally dual integral, then all basic solutions are integral. If the input matrix is sufficient or rank-symmetric, and the LCP is totally dual integral, then our result implies that the LCP always has an integral solution whenever it has a solution. We also introduce a class of matrices such that any LCP instance having the matrix as a coefficient matrix is totally dual integral. We investigate relationships between matrix classes in the LCP literature such as principally unimodular matrices. Principally unimodular matrices are known that all basic solutions to the LCP are integral for any integral input vector. In addition, we show that it is coNP-hard to decide whether a given LCP instance is totally dual integral.

KW - Linear complementarity problem

KW - Principal unimodularity

KW - Total dual integrality

UR - http://www.scopus.com/inward/record.url?scp=85048568267&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85048568267&partnerID=8YFLogxK

U2 - 10.1007/s10479-018-2926-8

DO - 10.1007/s10479-018-2926-8

M3 - Article

AN - SCOPUS:85048568267

SN - 0254-5330

VL - 274

SP - 531

EP - 553

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 1-2

ER -