The Extended Linear Complementarity Problem [PDF]
We consider an extension of the horizontal linear complementarity problem, which we call the extended linear complementarity problem (XLCP). With the aid of a natural bilinear program, we establish various properties of this extended complementarity problem; these include the convexity of the bilinear objective function under a monotonicity assumption,
O. L. Mangasarian, Jong-Shi Pang
exaly +8 more sources
Scarf’s generalization of linear complementarity problem revisited [PDF]
In this paper, we revisit Scarf’s generalization of the linear complementarity problem, formulate this as a vertical linear complementarity problem and obtain some new results on this generalization.
Neogy S.K., Sinha S., Das A.K., Gupta A.
doaj +3 more sources
On the preconditioned GAOR method for a linear complementarity problem with an M-matrix [PDF]
Recently, based on the Hadjidimos preconditioner, a preconditioned GAOR method was proposed for solving the linear complementarity problem (Liu and Li in East Asian J. Appl. Math. 2:94–107, 2012).
Shu-Xin Miao, Dan Zhang
doaj +2 more sources
The Linear Dynamic Complementarity Problem is a special case of the Extended Linear Complementarity Problem [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Schutter, Bart, de Moor, Bart
openaire +4 more sources
On the equivalence of linear complementarity problems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bart De Schutter +2 more
openaire +6 more sources
Reformulations of mathematical programming problems as linear complementarity problems [PDF]
A family of complementarity problems are defined as extensions of the well known Linear Complementarity Problem (LCP). These are (i.) Second Linear Complementarity Problem (SLCP) which is an LCP extended by introducing further equality restrictions and ...
Mitra, G, Judice, JJ
core +7 more sources
An enumerative method for the solution of linear complementarity problems [PDF]
In this report an enumerative method for the solution of the Linear Complementarity Problem (LCP) is presented. This algorithm completely processes the LCP, and does not require any particular property of the LCP to apply.
Mitra, G, Judice, JJ
core +7 more sources
Polyhedral complementarity problem with quasimonotone decreasing mappings [PDF]
The fixed point problem of piecewise constant mappings in Rn is investigated. This is a polyhedral complementarity problem, which is a generalization of the linear complementarity problem.
Shmyrev Vadim I.
doaj +1 more source
On linear problems with complementarity constraints [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Letizia Pellegrini +2 more
openaire +2 more sources
Multiparametric Linear Complementarity Problems [PDF]
The linear complementarity problem (LCP) is a general problem that unifies linear and quadratic programs and bimatrix games. In this paper, we present an efficient algorithm for the solution to multiparametric linear complementarity problems (pLCPs) that are defined by positive semi-definite matrices. This class of problems includes the multiparametric
Colin N. Jones, Manfred Morari
openaire +2 more sources

