Results 241 to 250 of about 8,709,898 (283)
Some of the next articles are maybe not open access.

Integer Solution for Linear Complementarity Problem

Mathematics of Operations Research, 1998
We consider the problem of finding an integer solution to a linear complementarity problem. We introduce the class I of matrices for which the corresponding linear complementarity problem has an integer complementary solution for every vector, q, for which it has a solution.
R. Chandrasekaran   +2 more
openaire   +2 more sources

On Solution Stability of the Linear Complementarity Problem

Mathematics of Operations Research, 1992
In the paper [5], C. D Ha introduced the notion of stability of a linear complementarity problem at a solution point and established several sufficient conditions for stability to hold. In the present paper, we derive some new stability results which significantly improve Ha's results.
M. Seetharama Gowda, Jong-Shi Pang
openaire   +2 more sources

Integral Solutions of Linear Complementarity Problems

Mathematics of Operations Research, 1998
We characterize the class of integral square matrices M having the property that for every integral vector q the linear complementarity problem with data M, q has only integral basic solutions. These matrices, called principally unimodular matrices, are those for which every principal nonsingular submatrix is unimodular. As a consequence, we show that
William H. Cunningham, James F. Geelen
openaire   +2 more sources

Complementarity problems in linear complementarity systems

Proceedings of the 1998 American Control Conference. ACC (IEEE Cat. No.98CH36207), 1998
Complementarity systems are described by differential and algebraic equations and inequalities similar to those appearing in the linear complementarity problem (LCP) of mathematical programming. Typical examples of such systems include mechanical systems subject to unilateral constraints, electrical networks with diodes, processes subject to relays and/
Heemels, W.P.M.H.   +2 more
openaire   +3 more sources

On the Solution Sets of Linear Complementarity Problems

SIAM Journal on Matrix Analysis and Applications, 2000
In this article we consider two problems related to the solution sets of linear complementarity problems (LCPs)---one on the connectedness and the other on the convexity. In Jones and Gowda [ Linear Algebra Appl., 246 (1996), pp. 299--312], it was shown that the solution sets of LCPs arising out of $P_0 \cap Q$-matrices are connected, and they ...
G. S. R. Murthy   +2 more
openaire   +1 more source

Cycling in linear complementarity problems

Mathematical Programming, 1979
A bound for the minimum length of a cycle in Lemke's Algorithm is derived. An example illustrates that this bound is sharp, and that the fewest number of variables is seven.
openaire   +3 more sources

Linear complementarity problems and bi-linear games

Applications of Mathematics, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sengodan, Gokulraj   +1 more
openaire   +2 more sources

On the Parametric Linear Complementarity Problem

Journal of Optimization Theory and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Degeneracy in linear complementarity problems: a survey

Annals of Operations Research, 1993
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Linear Complementarity Problem with a P-Matrix

SIAM Review, 2004
In this paper, we present an application of a linear complementarity problem where M is a P-matrix but, in general, is neither an H-matrix nor a positive definite matrix. This application occurs originally in [J. Rohn, Linear Algebra Appl., 126 (1989), pp. 39--78], which is less known to the LCP community.
openaire   +2 more sources

Home - About - Disclaimer - Privacy