Abstrakt
We consider the horizontal linear complementarity problem and we assume that the input data have the form of intervals, representing the range of possible values. For the classical linear complementarity problem, there are known various matrix classes that identify interesting properties of the problem (such as solvability, uniqueness, convexity, finite number of solutions or boundedness).
Our aim is to characterize the robust version of these properties, that is, to check them for all possible realizations of interval data. We address successively the following matrix classes: nonnegative matrices, Z-matrices, semimonotone matrices, column sufficient matrices, principally nondegenerate matrices, R0 -matrices and R-matrices.
The reduction of the horizontal linear complementarity problem to the classical one, however, brings complicated dependencies between interval parameters, resulting in some cases to higher computational complexity. (C) 2021, Springer Nature Switzerland AG.