An RLT approach for solving the binary-constrained mixed linear complementarity problem

DOI10.1016/j.cor.2019.05.008zbMath1458.90594OpenAlexW2944320369WikidataQ127940536 ScholiaQ127940536MaRDI QIDQ2002841

Miguel F. Anjos, Franklin Djeumou Fomeni, Steven A. Gabriel

Publication date: 12 July 2019

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/91156703/BC_MLCP_3rd_Revision_March_2019_final.pdf

zbMATH Keywords

linear programmingmixed integer linear programmingelectricity marketmixed linear complementarity problemsreformulation linearization technique

Mathematics Subject Classification ID

Mixed integer programming (90C11) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems, Solving binary-constrained mixed complementarity problems using continuous reformulations, Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems, Solving linear programs with complementarity constraints using branch-and-cut

Uses Software

• Meschach
• CPLEX
• LPCCbnc

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving discretely-constrained Nash-Cournot games with an application to power markets
• Feasibility problems with complementarity constraints
• A two-phase algorithm for the multiparametric linear complementarity problem
• Solving discretely constrained, mixed linear complementarity problems with applications in energy
• Three enhancements for optimization-based bound tightening
• On the solution of NP-hard linear complementarity problems
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• An algorithm for the fast solution of symmetric linear complementarity problems
• An experimental investigation of enumerative methods for the linear complementarity problem
• Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
• An iterative two-step algorithm for linear complementarity problems
• Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems
• Solving discretely constrained mixed complementarity problems using a median function
• An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
• Unified approaches for solvable and unsolvable linear complementarity problems
• A global optimization algorithm for linear fractional and bilinear programs
• A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
• Complementary pivot theory of mathematical programming
• Integral Solutions of Linear Complementarity Problems
• Integer Solution for Linear Complementarity Problem
• Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• An implicit enumeration procedure for the general linear complementarity problem
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• The integer linear complementarity problem
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Engineering and Economic Applications of Complementarity Problems
• Limited memory solution of bound constrained convex quadratic problems arising in video games
• Bimatrix Equilibrium Points and Mathematical Programming
• Complementarity problems