Convexification Techniques for Linear Complementarity Constraints

DOI10.1007/978-3-642-20807-2_27zbMath1341.90130OpenAlexW2198989606MaRDI QIDQ3009774

Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_27

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem, Simultaneous Convexification of Bilinear Functions over Polytopes with Application to Network Interdiction, The Convex Hull of a Quadratic Constraint over a Polytope, Branch-and-cut for complementarity-constrained optimization, How to convexify the intersection of a second order cone and a nonconvex quadratic, A multi-term, polyhedral relaxation of a 0-1 multilinear function for Boolean logical pattern generation, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Convexification techniques for linear complementarity constraints, New SOCP relaxation and branching rule for bipartite bilinear programs

Cites Work

• On linear programs with linear complementarity constraints
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• Disjunctive programming: Properties of the convex hull of feasible points
• A polyhedral study of nonconvex quadratic programs with box constraints
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cutting-Planes for Complementarity Constraints
• Variational Analysis
• Engineering and Economic Applications of Complementarity Problems
• Convex Analysis
• Facets of the Complementarity Knapsack Polytope