An RLT approach for solving the binary-constrained mixed linear complementarity problem
Franklin Djeumou Fomeni, Steven A. Gabriel, Miguel F. Anjos
Abstract
Franklin Djeumou Fomeni, Steven A. Gabriel, Miguel F. Anjos
Abstract
It is well known that the mixed linear complementarity problem can be used to model equilibria in energy markets as well as a host of other engineering and economic problems. The binary-constrained, mixed linear complementarity problem is a formulation of the mixed linear complementarity problem in which some variables are restricted to be binary. This paper presents a novel approach for solving the binary-constrained mixed linear complementarity problem. First we solve a series of linear optimization problems that enables us to replace some of the complementarity constraints with linear equations. Then we solve an equivalent mixed integer linear programming formulation of the original binary-constrained mixed, linear complementarity problem (with a smaller number of complementarity constraints) to guarantee a solution to the problem. Our computational results on a wide range of test problems, including some engineering examples, demonstrate the usefulness and the effectiveness of this novel approach.
OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
It is well known that the mixed linear complementarity problem can be used to model equilibria in energy markets as well as a host of other engineering and economic problems. The binary-constrained, mixed linear complementarity problem is a formulation of the mixed linear complementarity problem in which some variables are restricted to be binary. This paper presents a novel approach for solving the binary-constrained mixed linear complementarity problem. First we solve a series of linear optimization problems that enables us to replace some of the complementarity constraints with linear equations. Then we solve an equivalent mixed integer linear programming formulation of the original binary-constrained mixed, linear complementarity problem (with a smaller number of complementarity constraints) to guarantee a solution to the problem. Our computational results on a wide range of test problems, including some engineering examples, demonstrate the usefulness and the effectiveness of this novel approach.
Key concepts: Mixed complementarity problem, Complementarity theory, Linear complementarity problem, Complementarity (molecular biology), Linear programming, Mathematical optimization, Binary number, Mathematics