An enhanced logical benders approach for linear programs with complementarity constraints

DOI10.1007/S10898-020-00905-ZMaRDI QIDQ785626zbMATH OpenOpenAlexFDO

Authors Francisco Jara-Moroni, John E. Mitchell, Jong-Shi Pang, Andreas Wächter

Publication date 7 August 2020

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-020-00905-z

zbMATH Keywords

branch-and-boundcomplementarity constraintscut generationlogical Benders

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Solving linear programs with complementarity constraints using branch-and-cut
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• Global optimization method for solving mathematical programs with linear complementarity constraints
• Obtaining tighter relaxations of mathematical programs with complementarity constraints
• On linear programs with linear complementarity constraints

Cites work

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A machine learning-based approximation of strong branching
• An LPCC approach to nonconvex quadratic programs
• Branch-and-cut for linear programs with overlapping SOS1 constraints
• Complementarity formulations of \(\ell_0\)-norm optimization
• Cutting-Planes for Complementarity Constraints
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Exploiting erraticism in search
• Handbook of knowledge representation.
• scientific article; zbMATH DE number 7124428 (Why is no real title available?)
• Information-based branching schemes for binary linear mixed integer problems
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Logic-based Benders decomposition
• Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
• On convex quadratic programs with linear complementarity constraints
• On handling indicator constraints in mixed integer programming
• On learning and branching: a survey
• On linear programs with linear complementarity constraints
• On mathematical programming with indicator constraints
• On the Global Solution of Linear Programs with Linear Complementarity Constraints
• Solving linear programs with complementarity constraints using branch-and-cut
• Solving mathematical programs with complementarity constraints as nonlinear programs
• Technical Note—Complementary Programming
• Technical Note—The Use of Cuts in Complementary Programming
• The polynomial hierarchy and a simple model for competitive analysis

Cited in

(2)

• Improving the solution of indefinite quadratic programs and linear programs with complementarity constraints by a progressive MIP method
• A conditional logic approach for strengthening mixed 0-1 linear programs

Describes a project that uses

Uses Software

• CPLEX
• Gurobi
• MacMPEC
• LPCCbnc

This page was built for publication: An enhanced logical benders approach for linear programs with complementarity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q785626)