A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems

References

• Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper. Res. Lett. 33(1):42–54.Crossref, Google Scholar
• Beck A (2017) First-Order Methods in Optimization, vol. 25 (SIAM).Crossref, Google Scholar
• Benichou M, Gauthier JM, Girodet P, Hentges G, Ribiere G, Vincent O (1971) Experiments in mixed-integer linear programming. Math. Programming 1(1):76–94.Crossref, Google Scholar
• Chandrasekaran R, Kabadi SN, Sridhar R (1998) Integer solution for linear complementarity problem. Math. Oper. Res. 23(2):390–402.Link, Google Scholar
• Cottle RW, Pang JS, Stone RE (2009) The Linear Complementarity Problem (Society for Industrial and Applied Mathematics).Crossref, Google Scholar
• Cunningham WH, Geelen JF (1998) Integral solutions of linear complementarity problems. Math. Oper. Res. 23(1):61–68.Link, Google Scholar
• De Santis M, Lucidi S, Rinaldi F (2013) A new class of functions for measuring solution integrality in the feasibility pump approach. SIAM J. Optim. 23(3):1575–1606.Crossref, Google Scholar
• Dolan ED, Moré JJ (2002) Benchmarking optimization software with performance profiles. Math. Programming 91(2):201–213.Crossref, Google Scholar
• Dubey D, Neogy SK (2018) Total dual integrality and integral solutions of the linear complementarity problem. Linear Algebra Appl. 557:359–374.Crossref, Google Scholar
• Fomeni FD, Gabriel SA, Anjos MF (2019a) Applications of logic constrained equilibria to traffic networks and to power systems with storage. J. Oper. Res. Soc. 70(2):310–325.Crossref, Google Scholar
• Fomeni FD, Gabriel SA, Anjos MF (2019b) An RLT approach for solving the binary-constrained mixed linear complementarity problem. Comput. Oper. Res. 110:48–59.Crossref, Google Scholar
• Gabriel SA (1998) A hybrid smoothing method for mixed nonlinear complementarity problems. Comput. Optim. Appl. 9(2):153–173.Crossref, Google Scholar
• Gabriel SA (2017) Solving discretely constrained mixed complementarity problems using a median function. Optim. Engrg. 18(3):631–658.Crossref, Google Scholar
• Gabriel SA, Moré JJ (1997) Smoothing of mixed complementarity problems. Complementarity and Variational Problems: State of the Art, 105–116.Google Scholar
• Gabriel SA, Leal M, Schmidt M (2021) Solving binary-constrained mixed complementarity problems using continuous reformulations. Comput. Oper. Res. 131:105208.Crossref, Google Scholar
• Gabriel SA, Conejo AJ, Ruiz C, Siddiqui S (2013a) Solving discretely constrained, mixed linear complementarity problems with applications in energy. Comput. Oper. Res. 40(5):1339–1350.Crossref, Google Scholar
• Gabriel SA, Siddiqui SA, Conejo AJ, Ruiz C (2013b) Solving discretely-constrained Nash–Cournot games with an application to power markets. Networks Spatial Econom. 13(3):307–326.Google Scholar
• Gabriel SA, Conejo AJ, Fuller JD, Hobbs BF, Ruiz C (2012) Complementarity Modeling in Energy Markets, vol. 180 (Springer Science & Business Media).Google Scholar
• Giannessi F, Tardella F (1998) Connections between nonlinear programming and discrete optimization. Handbook of Combinatorial Optimization (Springer), 149–188.Crossref, Google Scholar
• Lucidi S, Rinaldi F (2010) Exact penalty functions for nonlinear integer programming problems. J. Optim. Theory Appl. 145(3):479–488.Crossref, Google Scholar
• Pardalos PM (1988) Linear complementarity problems solvable by integer programming. Optim. 19(4):467–474.Crossref, Google Scholar
• Pardalos PM (1994) The Linear Complementarity Problem, vol. 275 (Springer, Netherlands), 39–49.Google Scholar
• Pardalos PM (1996) Continuous Approaches to Discrete Optimization Problems (Springer US), 313–325.Crossref, Google Scholar
• Pardalos PM, Nagurney A (1990) The integer linear complementarity problem. Internat. J. Comput. Math. 31(3–4):205–214.Crossref, Google Scholar
• Pardalos PM, Rosen J (1988) Global optimization approach to the linear complementarity problem. SIAM J. Sci. Statist. Comput. 9(2):341–353.Google Scholar
• Rinaldi F (2009) New results on the equivalence between zero-one programming and continuous concave programming. Optim. Lett. 3(3):377–386.Crossref, Google Scholar
• Sumita H, Kakimura N, Makino K (2018) Total dual integrality of the linear complementarity problem. Ann. Oper. Res. 274(1–2):531–553.Crossref, Google Scholar
• Val PD (1940) The unloading problem for plane curves. Amer. J. Math. 62(1):307–311.Crossref, Google Scholar
• Weinhold R, Gabriel SA (2020) Discretely constrained mixed complementary problems: Application and analysis of a stylised electricity market. J. Oper. Res. Soc. 71(2):237–249.Crossref, Google Scholar
• Zhu WX (2003) Penalty parameter for linearly constrained 0–1 quadratic programming. J. Optim. Theory Appl. 116(1):229–239.Crossref, Google Scholar