The Linear Complementarity Problem on Oriented Matroids
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E83-D No.3 pp.353-361
- Publication Date
- 2000/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- INVITED SURVEY PAPER
- Category
- Algorithms for Matroids and Related Discrete Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Akihisa TAMURA, "The Linear Complementarity Problem on Oriented Matroids" in IEICE TRANSACTIONS on Information,
vol. E83-D, no. 3, pp. 353-361, March 2000, doi: .
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e83-d_3_353/_p
Copy
@ARTICLE{e83-d_3_353,
author={Akihisa TAMURA, },
journal={IEICE TRANSACTIONS on Information},
title={The Linear Complementarity Problem on Oriented Matroids},
year={2000},
volume={E83-D},
number={3},
pages={353-361},
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.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - The Linear Complementarity Problem on Oriented Matroids
T2 - IEICE TRANSACTIONS on Information
SP - 353
EP - 361
AU - Akihisa TAMURA
PY - 2000
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E83-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2000
AB - 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.
ER -
English
