An experimental investigation of enumerative methods for the linear complementarity problem

DOI10.1016/0305-0548(88)90058-5zbMath0647.90095OpenAlexW2061110395MaRDI QIDQ1104872

Ana M. Faustino, Joaquim Joao Júdice

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

zbMATH Keywords

linear complementarityenumerative tree-search methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Bilevel linear programming ⋮ Bilevel and multilevel programming: A bibliography review ⋮ The steepest descent direction for the nonlinear bilevel programming problem ⋮ A multilevel analysis of agricultural credit distribution in East Java, Indonesia ⋮ A note on the Pareto optimality of solutions to the linear bilevel programming problem ⋮ An enumerative method for the solution of linear complementarity problems ⋮ Algorithms for linear programming with linear complementarity constraints ⋮ Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\) ⋮ A computational analysis of LCP methods for bilinear and concave quadratic programming ⋮ A sequential LCP method for bilevel linear programming ⋮ An algorithm for the mixed-integer nonlinear bilevel programming problem ⋮ An RLT approach for solving the binary-constrained mixed linear complementarity problem ⋮ On the solution of NP-hard linear complementarity problems ⋮ A trust-region method for nonlinear bilevel programming: algorithm and computational exper\-ience ⋮ Enumeration approach for linear complementarity problems based on a reformulation-linearization technique

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
• An LP-based successive overrelaxation method for linear complementarity problems
• An enumerative method for the solution of linear complementarity problems
• Computation of economic equilibria by a sequence of linear complementarity problems
• An implicit enumeration procedure for the general linear complementarity problem
• Global Optimization Approach to the Linear Complementarity Problem
• Computing equilibria via nonconvex programming
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• On the solution of some (parametric) linear complementarity problems with applications to portfolio selection, structural engineering and actuarial graduation
• New Finite Pivoting Rules for the Simplex Method
• Two-Level Linear Programming
• Application of disjunctive programming to the linear complementarity problem