Enhanced intersection cutting-plane approach for linear complementarity problems
From MaRDI portal
Publication:2565006
DOI10.1007/BF02192252zbMath0866.90126MaRDI QIDQ2565006
Hanif D. Sherali, Faiz A. Al-Khayyal, R. S. Krishnamurthy
Publication date: 20 July 1997
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
linear complementarity; nonconvex programming; cutting planes; vertex ranking; enhanced intersection cutting-plane algorithm; mixed integer 0-1 bilinear programming; Tuy intersection cuts
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
Related Items
Enumeration approach for linear complementarity problems based on a reformulation-linearization technique, On the equivalence of linear complementarity problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Pivoting rules and redundancy schemes in extreme point enumeration
- Bounds for the solution set of linear complementarity 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 new reformulation-linearization technique for bilinear programming problems
- Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
- Jointly Constrained Biconvex Programming
- An implicit enumeration procedure for the general linear complementarity problem
- Global Optimization Approach to the Linear Complementarity Problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A cutting plane algorithm for solving bilinear programs
- A cutting plane algorithm for the bilinear programming problem
- Implementing a random number package with splitting facilities
- Polyhedral convexity cuts and negative edge extensions
- Application of disjunctive programming to the linear complementarity problem
- A method for solving maximum-problems with a nonconcave quadratic objective function
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Solving the Fixed Charge Problem by Ranking the Extreme Points
