Enhanced intersection cutting-plane approach for linear complementarity problems

DOI10.1007/BF02192252MaRDI QIDQ2565006zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

nonconvex programmingcutting planesvertex rankinglinear complementarityenhanced intersection cutting-plane algorithmmixed integer 0-1 bilinear programmingTuy intersection cuts

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 653034 (Why is no real title available?)
• scientific article; zbMATH DE number 3215121 (Why is no real title available?)
• scientific article; zbMATH DE number 4189490 (Why is no real title available?)
• A class of linear complementarity problems solvable in polynomial time
• A cutting plane algorithm for solving bilinear programs
• A cutting plane algorithm for the bilinear programming problem
• A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
• A method for solving maximum-problems with a nonconcave quadratic objective function
• A new polynomial-time algorithm for linear programming
• A new reformulation-linearization technique for bilinear programming problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An implicit enumeration procedure for the general linear complementarity problem
• Application of disjunctive programming to the linear complementarity problem
• Bounds for the solution set of linear complementarity problems
• Global Optimization Approach to the Linear Complementarity Problem
• Implementing a random number package with splitting facilities
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Jointly Constrained Biconvex Programming
• Pivoting rules and redundancy schemes in extreme point enumeration
• Polyhedral convexity cuts and negative edge extensions
• Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm
• Solving the Fixed Charge Problem by Ranking the Extreme Points

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
• scientific article; zbMATH DE number 4095234 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• XMP

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)