An RLT approach for solving the binary-constrained mixed linear complementarity problem
type: Item
instance of: scholarly article
title: An RLT approach for solving the binary-constrained mixed linear complementarity problem
zbMATH Open document ID: 1458.90594
author: Franklin Djeumou Fomeni
author: Steven A. Gabriel
author: Miguel F. Anjos
published in: Computers \& Operations Research
publication date: 2019-07-12T00:00:00Z
full work available at URL: BC MLCP 3rd Revision March 2019 final.pdf
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 7080338
zbMATH Keywords: mixed linear complementarity problems
zbMATH Keywords: mixed integer linear programming
zbMATH Keywords: reformulation linearization technique
zbMATH Keywords: electricity market
zbMATH Keywords: linear programming
describes a project that uses: CPLEX
describes a project that uses: LPCCbnc
describes a project that uses: Meschach
MaRDI profile type: Publication
OpenAlex ID: W2944320369
cites work: A two-phase algorithm for the multiparametric linear complementarity problem
cites work: An implicit enumeration procedure for the general linear complementarity problem
cites work: Feasibility problems with complementarity constraints
cites work: Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems
cites work: A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
cites work: Complementarity problems
cites work: Integer solution for linear complementarity problem
cites work: Complementary pivot theory of mathematical programming
cites work: Q4003375
cites work: Integral solutions of linear complementarity problems
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: Limited memory solution of bound constrained convex quadratic problems arising in video games
cites work: Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
cites work: A Representation and Economic Interpretation of a Two-Level Programming Problem
cites work: Solving discretely constrained mixed complementarity problems using a median function
cites work: Solving discretely constrained, mixed linear complementarity problems with applications in energy
cites work: Solving discretely-constrained Nash-Cournot games with an application to power markets
cites work: Three enhancements for optimization-based bound tightening
cites work: An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
cites work: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
cites work: On the solution of NP-hard linear complementarity problems
cites work: An experimental investigation of enumerative methods for the linear complementarity problem
cites work: An iterative two-step algorithm for linear complementarity problems
cites work: Unified approaches for solvable and unsolvable linear complementarity problems
cites work: Bimatrix Equilibrium Points and Mathematical Programming
cites work: Q5608986
cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
cites work: An algorithm for the fast solution of symmetric linear complementarity problems
cites work: Q4039868
cites work: The integer linear complementarity problem
cites work: A global optimization algorithm for linear fractional and bilinear programs
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: Enumeration approach for linear complementarity problems based on a reformulation-linearization technique
cites work: Q4344925
cites work: Q4353554
cites work: Dynamic reserve selection: optimal land retention with land-price feedbacks
cites work: Q3594586
Wikidata QID: Q127940536
DOI: 10.1016/J.COR.2019.05.008
description: scientific article; zbMATH DE number 7080338