An implicit enumeration procedure for the general linear complementarity problem
From MaRDI portal
Publication:3762094
DOI10.1007/BFB0121176zbMATH Open0623.90079OpenAlexW18242230MaRDI QIDQ3762094FDOQ3762094
Authors: Faiz Al-Khayyal 
Publication date: 1987
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0121176
Recommendations
- An enumerative method for the solution of linear complementarity problems
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Linear complementarity procedures in quadratic programming
- An experimental investigation of enumerative methods for the linear complementarity problem
- The generalized linear complementarity problem and an algorithm to find all its solutions
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (34)
- An enumerative method for the solution of linear complementarity problems
- Bilevel linear programming
- A high accuracy method for solving ODEs with discontinuous right-hand side
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- On the solution of NP-hard linear complementarity problems
- On the numerical solution of the linear complementarity problem
- An experimental investigation of enumerative methods for the linear complementarity problem
- Title not available (Why is that?)
- An abstract model for branch and cut
- A sequential LCP method for bilevel linear programming
- A linear combinatorial projection method for a class of generalized implicit complementarity problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Linear complementarity procedures in quadratic programming
- Necessary and sufficient conditions for the existence of complementary solutions and characterizations of the matrix classes \(Q\) and \(Q_ 0\)
- Jointly constrained bilinear programs and related problems: An overview
- On characterizing linear complementarity problems as linear programs
- Reformulation of mathematical programming problems as linear complementarity problems and investigation of their solution methods
- An Improved Implicit Enumeration Approach for Integer Programming
- Solving non-monotone equilibrium problems via a DIRECT-type approach
- Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems
- The generalized linear complementarity problem and an algorithm to find all its solutions
- Enhanced intersection cutting-plane approach for linear complementarity problems
- An abstract model for branch-and-cut
- An implicit enumeration scheme for the batch selection problem
- POST-BUCKLING ANALYSIS WITH FRICTIONAL CONTACTS COMBINING COMPLEMENTARITY RELATIONS AND AN ARC-LENGTH METHOD
- Hybrid evolutionary algorithm for solving general variational inequality problems
- Enumeration-based approach to solving parametric linear complementarity problems
- Descent approaches for quadratic bilevel programming
- Deterministic methods in constrained global optimization: Some recent advances and new fields of application
- Global Optimization Approach to the Linear Complementarity Problem
- Algorithms for linear programming with linear complementarity constraints
- Note on solving linear complementarity problems as jointly constrained bilinear programs
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- Enumerative techniques for solving some nonconvex global optimization problems
This page was built for publication: An implicit enumeration procedure for the general linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3762094)
