Back to search

Linear complementarity problems solvable by A single linear program

Data up to Jan 2025

Published1976
Citations120
References21

Total Citations Per Year

Abstract

References (21)

Linear Programming and Extensions

1963 • 5,853 citations

Linear Programming and Extensions

1963 • 2,647 citations

The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming

1967 • 2,568 citations

Nonlinear Programming

1969 • 2,011 citations

On matrices with non-positive off-diagonal elements and positive principal minors

1962 • 820 citations

Complementary pivot theory of mathematical programming

1968 • 741 citations

The Relaxation Method for Linear Inequalities

1954 • 454 citations

Nonlinear Programming

1970 • 450 citations

The Solution of a Quadratic Programming Problem Using Systematic Overrelaxation

1971 • 435 citations

The method of successive projection for finding a common point of convex sets

1965 • 290 citations

On the number of solutions to the complementarity problem and spanning properties of complementary cones

1972 • 251 citations

ИССЛЕДОВАНИЕ НЕКОТО РЫХ СЛОЖНЫХ ПОЛУПРОВОДНИКОВЫХ Т ВДРДЫХ РАСТВОРОВ И СОЕДИНЕНИЙ НА ОСНОВ Е ИНДИЯ

1962 • 137 citations

Mathematical Programming.

1985 • 129 citations

Polyhedral sets having a least element

1972 • 108 citations

Recent Results on Complementarity Problems

1970 • 87 citations

The method of Christopherson for solving free boundary problems for infinite journal bearings by means of finite differences

1971 • 66 citations

Minimality and complementarity properties associated with Z-functions and M-functions

1974 • 55 citations

On the Alass of Complementary Cones and Lemke’s Algorithm

1972 • 53 citations

On the solution of large, structured linear complementarity problems: III.

1974 • 31 citations

Maturity: A biomedical or political concept

1975 • 2 citations

Deleted Work

1955 • 0 citations

Cited By (0)

Loading...