Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 353-361 |
| Number of pages | 9 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E83-D |
| Issue number | 3 |
| Publication status | Published - 2000 Jan 1 |
| Externally published | Yes |
Keywords
- Criss-cross algorithm
- Linear complementarity problem
- Oriented matroids
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence