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

被引:5
作者
Fomeni, Franklin Djeumou [1 ,2 ]
Gabriel, Steven A. [3 ,4 ]
Anjos, Miguel E. [5 ,6 ,7 ]
机构
[1] Univ Quebec, CIRRELT, Montreal, PQ, Canada
[2] Univ Quebec, Dept Management & Technol, Montreal, PQ, Canada
[3] Univ Maryland, College Pk, MD 20742 USA
[4] Norwegian Univ Sci & Technol, Dept Ind Econ & Technol Management, Energy Transit Programme, Trondheim, Norway
[5] Univ Edinburgh, Sch Math, Edinburgh, Midlothian, Scotland
[6] Polytech Montreal, GERAD, Montreal, PQ, Canada
[7] Polytech Montreal, Dept Math & Ind Engn, Montreal, PQ, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
Mixed linear complementarity problems; Mixed integer linear programming; Reformulation linearization technique; Electricity market; Linear programming; GLOBAL OPTIMIZATION; ALGORITHM; BRANCH;
D O I
10.1016/j.cor.2019.05.008
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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. (C) 2019 Elsevier Ltd. All rights reserved.
引用
收藏
页码:48 / 59
页数:12
相关论文
共 48 条
[1]   A two-phase algorithm for the multiparametric linear complementarity problem [J].
Adelgren, Nathan ;
Wiecek, Margaret M. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 254 (03) :715-738
[2]  
ALKHAYYAL FA, 1987, MATH PROGRAM STUD, V31, P1
[3]   Feasibility problems with complementarity constraints [J].
Andreani, R. ;
Judice, J. J. ;
Martinez, J. M. ;
Martini, T. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 249 (01) :41-54
[4]   Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems [J].
Anitescu, M ;
Potra, FA .
NONLINEAR DYNAMICS, 1997, 14 (03) :231-247
[5]  
[Anonymous], 1997, COMPLEMENTARITY VARI
[6]  
[Anonymous], 2012, Socio-Economic Planning Sciences, DOI [DOI 10.1016/J.SEPS.2011.04.004, 10.1016/j.seps.2011.04.004, 10.1016/j.spes.2011.04.004, DOI 10.1016/J.SPES.2011.04.004]
[7]   A branch and cut algorithm for nonconvex quadratically constrained quadratic programming [J].
Audet, C ;
Hansen, P ;
Jaumard, B ;
Savard, G .
MATHEMATICAL PROGRAMMING, 2000, 87 (01) :131-152
[8]   Complementarity problems [J].
Billups, SC ;
Murty, KG .
JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2000, 124 (1-2) :303-318
[9]   Integer solution for linear complementarity problem [J].
Chandrasekaran, R ;
Kabadi, SN ;
Sridhar, R .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (02) :390-402
[10]  
Cottle R.W., 1968, Linear Algebra Its Appl, V1, P103, DOI [DOI 10.1016/0024-3795(68)90052-9, 10.1016/0024-3795(68)90052-9]