The Linear Complementarity Problem on Oriented Matroids

Akihisa TAMURA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E83-D   No.3   pp.353-361
Publication Date: 2000/03/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8532
Type of Manuscript: INVITED SURVEY PAPER
Category: Algorithms for Matroids and Related Discrete Systems
Keyword: 
linear complementarity problem,  oriented matroids,  criss-cross algorithm,  

Full Text: PDF(288.9KB)>>
Buy this Article



Summary: 
The linear complementarity problem (LCP) is one of the most widely studied mathematical programming problems. The theory of LCP can be extended to oriented matroids which are combinatorial abstractions of linear subspaces of Euclidean spaces. This paper briefly surveys the LCP, oriented matroids and algorithms for the LCP on oriented matroids.