Solving linear programs with complementarity constraints using branch-and-cut
From MaRDI portal
Publication:2281449
DOI10.1007/s12532-018-0149-2zbMath1434.90160arXiv1802.02941OpenAlexW2962818638MaRDI QIDQ2281449
Jong-Shi Pang, Bin Yu, John E. Mitchell
Publication date: 19 December 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.02941
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Extensions of Nash Games in Finite and Infinite Dimensions with Applications, Global solutions of nonconvex standard quadratic programs via mixed integer linear programming reformulations, LPCCbnc, On linear problems with complementarity constraints, An enhanced logical benders approach for linear programs with complementarity constraints, Bilevel hyperparameter optimization for support vector classification: theoretical analysis and a solution method
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On conic QPCCs, conic QCQPs and completely positive programs
- An LPCC approach to nonconvex quadratic programs
- On linear programs with linear complementarity constraints
- Branch-and-cut for complementarity-constrained optimization
- Three enhancements for optimization-based bound tightening
- Three modeling paradigms in mathematical programming
- Global resolution of the support vector machine regression parameters selection problem with LPCC
- Feasibility pump 2.0
- A sequential LCP method for bilevel linear programming
- A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms
- A symmetrical linear maxmin approach to disjoint bilinear programming
- Branch-and-cut for linear programs with overlapping SOS1 constraints
- A study of the difference-of-convex approach for solving linear programs with complementarity constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Branching rules revisited
- Algorithms for linear programming with linear complementarity constraints
- Mixed logical-linear programming
- An RLT approach for solving the binary-constrained mixed linear complementarity problem
- On convex quadratic programs with linear complementarity constraints
- Disjunctive cuts for continuous linear bilevel programming
- New branch-and-Cut algorithm for bilevel linear programming
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Branch-and-cut for combinatorial optimization problems without auxiliary binary variables
- An Implementable Active-Set Algorithm for Computing a B-Stationary Point of a Mathematical Program with Linear Complementarity Constraints
- A Globally Convergent Probability-One Homotopy for Linear Programs with Linear Complementarity Constraints
- A pivoting algorithm for linear programming with linear complementarity constraints
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- An Active-Set Newton Method for Mathematical Programs with Complementarity Constraints
- Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints
- A Branch and Bound Algorithm for the Bilevel Programming Problem
- On the Global Solution of Linear Programs with Linear Complementarity Constraints
- New Branch-and-Bound Rules for Linear Bilevel Programming
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cutting-Planes for Complementarity Constraints
- Disjunctive Programming
- Some Feasibility Issues in Mathematical Programs with Equilibrium Constraints
- A Computational Study of Search Strategies for Mixed Integer Programming
- On the global minimization of the value-at-risk
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Technical Note—The Use of Cuts in Complementary Programming
- Computational Integer Programming and Cutting Planes
- Interior Methods for Mathematical Programs with Complementarity Constraints
- Experiments in mixed-integer linear programming
- Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Mathematical Programs with Equilibrium Constraints
- A generalized assignment problem with special ordered sets: a polyhedral approach.
- Benchmarking optimization software with performance profiles.
