An experimental investigation of enumerative methods for the linear complementarity problem
DOI10.1016/0305-0548(88)90058-5zbMATH Open0647.90095OpenAlexW2061110395MaRDI QIDQ1104872FDOQ1104872
Authors: Joaquim J. Júdice, Ana M. Faustino 
Publication date: 1988
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(88)90058-5
Recommendations
- An enumerative method for the solution of linear complementarity problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- On the solution of NP-hard linear complementarity problems
- An implicit enumeration procedure for the general linear complementarity problem
- scientific article; zbMATH DE number 778140
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- New Finite Pivoting Rules for the Simplex Method
- Title not available (Why is that?)
- On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
- Computation of economic equilibria by a sequence of linear complementarity problems
- Two-Level Linear Programming
- Title not available (Why is that?)
- Global Optimization Approach to the Linear Complementarity Problem
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- An implicit enumeration procedure for the general linear complementarity problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Title not available (Why is that?)
- Application of disjunctive programming to the linear complementarity problem
- An enumerative method for the solution of linear complementarity problems
- An LP-based successive overrelaxation method for linear complementarity problems
- Computing equilibria via nonconvex programming
Cited In (17)
- An enumerative method for the solution of linear complementarity problems
- Bilevel linear programming
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- On the solution of NP-hard linear complementarity problems
- A computational analysis of LCP methods for bilinear and concave quadratic programming
- The steepest descent direction for the nonlinear bilevel programming problem
- Bilevel and multilevel programming: A bibliography review
- A sequential LCP method for bilevel linear programming
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience
- An algorithm for the mixed-integer nonlinear bilevel programming problem
- A note on the Pareto optimality of solutions to the linear bilevel programming problem
- A multilevel analysis of agricultural credit distribution in East Java, Indonesia
- An implicit enumeration procedure for the general linear complementarity problem
- Algorithms for linear programming with linear complementarity constraints
- Title not available (Why is that?)
This page was built for publication: An experimental investigation of enumerative methods for the linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1104872)
