Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
From MaRDI portal
Publication:1275717
DOI10.1023/A:1021734613201zbMath0911.90328MaRDI QIDQ1275717
Hanif D. Sherali, R. S. Krishnamurthy, Faiz A. Al-Khayyal
Publication date: 5 May 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Lagrangian relaxationlinear complementarity problembilinear programmingimplicit enumerationglobal optimization algorithmreformulation linearization technique
Mixed integer programming (90C11) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Algorithms for linear programming with linear complementarity constraints, On solving linear complementarity problems by DC programming and DCA, Enumeration-based approach to solving parametric linear complementarity problems, Numerical simulation of piecewise-linear models of gene regulatory networks using complementarity systems, Convexification Techniques for Linear Complementarity Constraints, An RLT approach for solving the binary-constrained mixed linear complementarity problem, On the solution of NP-hard linear complementarity problems, Convexification techniques for linear complementarity constraints, A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mixed-integer bilinear programming problems
- Bounds for the solution set of linear complementarity problems
- An experimental investigation of enumerative methods for the linear complementarity problem
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems
- A class of linear complementarity problems solvable in polynomial time
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- The linear complementarity problem as a separable bilinear program
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs
- Enhanced intersection cutting-plane approach for linear complementarity problems
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Self-Dual Quadratic Programs
- An implicit enumeration procedure for the general linear complementarity problem
- Global Optimization Approach to the Linear Complementarity Problem
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Technical Note—Surrogate Constraints and the Strength of Bounds Derived from 0-1 Benders' Partitioning Procedures
- Implementing a random number package with splitting facilities
- Application of disjunctive programming to the linear complementarity problem
- The Linear Complementarity Problem
