Enhanced intersection cutting-plane approach for linear complementarity problems
DOI10.1007/BF02192252zbMATH Open0866.90126OpenAlexW2030824295MaRDI QIDQ2565006FDOQ2565006
Authors: Hanif D. Sherali, R. S. Krishnamurthy, Faiz Al-Khayyal 
Publication date: 20 July 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02192252
Recommendations
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- Publication:5753757
- Application of disjunctive programming to the linear complementarity problem
- Linear, quadratic, and bilinear programming approaches to the linear complementarity problem
- scientific article; zbMATH DE number 653034
nonconvex programmingcutting planesvertex rankinglinear complementarityenhanced intersection cutting-plane algorithmmixed integer 0-1 bilinear programmingTuy intersection cuts
Cites Work
- A new polynomial-time algorithm for linear programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Title not available (Why is that?)
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- A new reformulation-linearization technique for bilinear programming problems
- Jointly Constrained Biconvex Programming
- Title not available (Why is that?)
- Implementing a random number package with splitting facilities
- A cutting plane algorithm for solving bilinear programs
- Solving the Fixed Charge Problem by Ranking the Extreme Points
- A class of linear complementarity problems solvable in polynomial time
- Global Optimization Approach to the Linear Complementarity Problem
- Title not available (Why is that?)
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A cutting plane algorithm for the bilinear programming problem
- Polyhedral convexity cuts and negative edge extensions
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
- An implicit enumeration procedure for the general linear complementarity problem
- Title not available (Why is that?)
- Bounds for the solution set of linear complementarity problems
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Pivoting rules and redundancy schemes in extreme point enumeration
- Application of disjunctive programming to the linear complementarity problem
Cited In (8)
- On the equivalence of linear complementarity problems
- Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
- A cutting plane method for bilevel linear programming with interval coefficients
- Title not available (Why is that?)
- Relaxations and cutting planes for linear programs with complementarity constraints
- Convexification techniques for linear complementarity constraints
- Application of disjunctive programming to the linear complementarity problem
- On the redundancy of cutting planes for linear complementarity problems
Uses Software
This page was built for publication: Enhanced intersection cutting-plane approach for linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2565006)
