Linear complementarity problems solvable by A single linear program
- 1 December 1976
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 10 (1), 263-270
- https://doi.org/10.1007/bf01580671
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Maturity: A biomedical or political conceptThe Urban Review, 1975
- Minimality and complementarity properties associated with Z-functions and M-functionsMathematical Programming, 1974
- On the Alass of Complementary Cones and Lemke’s AlgorithmSIAM Journal on Applied Mathematics, 1972
- On the number of solutions to the complementarity problem and spanning properties of complementary conesLinear Algebra and its Applications, 1972
- The Solution of a Quadratic Programming Problem Using Systematic OverrelaxationSIAM Journal on Control, 1971
- The method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differencesMathematics of Computation, 1971
- Complementary pivot theory of mathematical programmingLinear Algebra and its Applications, 1968
- The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programmingUSSR Computational Mathematics and Mathematical Physics, 1967
- ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯCzechoslovak Journal of Physics, 1962
- The Relaxation Method for Linear InequalitiesCanadian Journal of Mathematics, 1954