The Linear Complementarity Problems with a Few Variables per ConstraintOpen Website

2015 (modified: 20 May 2022)Math. Oper. Res. 2015Readers: Everyone
Abstract: In this paper, we consider the sparse linear complementarity problem, denoted by k-LCP: the coefficient matrices are restricted to have at most k nonzero entries per row. It is known that the 1-LCP...
0 Replies

Loading