## Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 1-23 |

Number of pages | 23 |

Journal | Annals of Operations Research |

DOIs | |

Publication status | Accepted/In press - 2018 Jun 14 |

## Keywords

- Linear complementarity problem
- Principal unimodularity
- Total dual integrality

## ASJC Scopus subject areas

- Decision Sciences(all)
- Management Science and Operations Research