On linear bilevel optimization problems with complementarity-constrained lower levels

References

• Caprara, A., Carvalho, M., Lodi, A., & Woeginger, G. J. (2016). Bilevel knapsack with interdiction constraints. INFORMS Journal on Computing, 28(2), 319–333. https://doi.org/10.1287/ijoc.2015.0676
   Web of Science ®Google Scholar
• Cottle, R. W., Pang, J.-S., & Stone, R. E. (2009.). The linear complementarity problem. Society for Industrial and Applied Mathematics.
   Google Scholar
• Daxhelet, O., & Smeers, Y. (2007). The EU regulation on cross-border trade of electricity: A two-stage equilibrium model. European Journal of Operational Research, 181(3), 1396–1412. https://doi.org/10.1016/j.ejor.2005.12.040
   Web of Science ®Google Scholar
• DeNegre, S. T. (2011). Interdiction and Discrete Bilevel Linear Programming. Phd thesis. Lehigh University.
   Google Scholar
• DeNegre, S. T., & Ralphs, T. K. (2009). A branch-and-cut algorithm for integer bilevel linear programs. In Operations Research and Cyber-Infrastructure. (pp. 65–78). Springer.
   Google Scholar
• Fischetti, M., Ljubić, I., Monaci, M., & Sinnl, M. (2017). A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations Research, 65(6), 1615–1637. https://doi.org/10.1287/opre.2017.1650
   Web of Science ®Google Scholar
• Fischetti, M., Ljubić, I., Monaci, M., & Sinnl, M. (2018). On the use of intersection cuts for bilevel optimization. Mathematical Programming, 172(1-2), 77–103. https://doi.org/10.1007/s10107-017-1189-5
   Web of Science ®Google Scholar
• Gabriel, S. A., Conejo, A. J., Fuller, J. D., Hobbs, B. F., & Ruiz, C. (2012). Complementarity Modeling in Energy Markets. (Vol. 180). Springer Science & Business Media.
   Google Scholar
• Grimm, V., Schewe, L., Schmidt, M., & Zöttl, G. (2019). A multilevel model of the European entry-exit gas market. Mathematical Methods of Operations Research, 89(2), 223–255. https://doi.org/10.1007/s00186-018-0647-z
   Web of Science ®Google Scholar
• Gu, Y., Cai, X., Han, D., & Wang, D. Z. (2019). A tri-level optimization model for a private road competition problem with traffic equilibrium constraints. European Journal of Operational Research, 273(1), 190–197. https://doi.org/10.1016/j.ejor.2018.07.041
   Web of Science ®Google Scholar
• Hansen, P., Jaumard, B., & Savard, G. (1992). New branch-and-bound rules for linear bilevel programming. SIAM Journal on Scientific and Statistical Computing, 13(5), 1194–1217. https://doi.org/10.1137/0913069
   Web of Science ®Google Scholar
• Hu, J., Mitchell, J. E., Pang, J.-S., Bennett, K. P., & Kunapuli, G. (2008). On the global solution of linear programs with linear complementarity constraints. SIAM Journal on Optimization, 19(1), 445–471. https://doi.org/10.1137/07068463x
   Web of Science ®Google Scholar
• Hu, J., Mitchell, J. E., Pang, J.-S., & Yu, B. (2012). On linear programs with linear complementarity constraints. Journal of Global Optimization, 53(1), 29–51. https://doi.org/10.1007/s10898-010-9644-3
   Web of Science ®Google Scholar
• Hu, X., & Ralph, D. (2007). Using EPECs to model bilevel games in restructured electricity markets with locational prices. Operations Research, 55(5), 809–827. https://doi.org/10.1287/opre.1070.0431
   Web of Science ®Google Scholar
• Jeroslow, R. G. (1985). The polynomial hierarchy and a simple model for competitive analysis. Mathematical Programming, 32(2), 146–164. https://doi.org/10.1007/BF01586088
   Web of Science ®Google Scholar
• Jin, S., & Ryan, S. M. (2014). A tri-level model of centralized tansmission and decentralized generation expansion planning for an electricity market—part i. IEEE Transactions on Power Systems, 29(1), 132–141. https://doi.org/10.1109/TPWRS.2013.2280085
   Google Scholar
• Kleinert, T., & Schmidt, M. (2019). Global optimization of multilevel electricity market models including network design and graph partitioning. Discrete Optimization, 33, 43–69. https://doi.org/10.1016/j.disopt.2019.02.002
   Web of Science ®Google Scholar
• Kleinert, T., & Schmidt, M. (2021). Computing feasible points of bilevel problems with a penalty alternating direction method. INFORMS Journal on Computing, 33(1), 198–215. https://doi.org/10.1287/ijoc.2019.0945
   Web of Science ®Google Scholar
• Kleniati, P.-M., & Adjiman, C. S. (2014a). Branch-and-sandwich: A deterministic global optimization algorithm for optimistic bilevel programming problems. Part ii: Convergence analysis and numerical results. Journal of Global Optimization, 60(3), 459–481. https://doi.org/10.1007/s10898-013-0120-8
   Web of Science ®Google Scholar
• Kleniati, P.-M., & Adjiman, C. S. (2014b). Branch-and-sandwich: A deterministic global optimization algorithm for optimistic bilevel programming problems. Part i: Theoretical development. Journal of Global Optimization, 60(3), 425–458. https://doi.org/10.1007/s10898-013-0121-7
   Web of Science ®Google Scholar
• Labbé, M., & Violin, A. (2013). Bilevel programming and price setting problems. 4OR, 11(1), 1–30. https://doi.org/10.1007/s10288-012-0213-0
   Google Scholar
• Li, Z., & Ierapetritou, M. G. (2010). A method for solving the general parametric linear complementarity problem. Annals of Operations Research, 181(1), 485–501. https://doi.org/10.1007/s10479-010-0770-6
   Web of Science ®Google Scholar
• Lozano, L., & Smith, J. C. (n.d.). A value-function-based exact approach for the bilevel mixed-integer programming problem. Operations Research, 65(3), 768–786. https://doi.org/10.1287/opre.2017.1589
   Web of Science ®Google Scholar
• Mitsos, A., Lemonidis, P., & Barton, P. I. (2008). Global solution of bilevel programs with a nonconvex inner program. Journal of Global Optimization, 42(4), 475–513. https://doi.org/10.1007/s10898-007-9260-z
   Web of Science ®Google Scholar
• Moore, J. T., & Bard, J. F. (1990). The mixed integer linear bilevel programming problem. Operations Research, 38(5), 911–921. https://doi.org/10.1287/opre.38.5.911
   Web of Science ®Google Scholar
• Tahernejad, S., Ralphs, T. K., & DeNegre, S. T. (2020). A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Mathematical Programming Computation, 12(4), 529–568. https://doi.org/10.1007/s12532-020-00183-6
   Web of Science ®Google Scholar
• White, D. J., & Anandalingam, G. (1993). A penalty function approach for solving bi-level linear programs. Journal of Global Optimization, 3(4), 397–419. https://doi.org/10.1007/BF01096412
   Web of Science ®Google Scholar
• Ye, J. J., & Zhu, D. L. (n.d.). Optimality conditions for bilevel programming problems. Optimization, 33(1), 9–27. https://doi.org/10.1080/02331939508844060
   Google Scholar
• Ye, Y., & Tse, E. (1989). An extension of karmarkar’s projective algorithm for convex quadratic programming. Mathematical Programming, 44(1-3), 157–179. https://doi.org/10.1007/BF01587086
   Google Scholar
• Yu, B., Mitchell, J. E., & Pang, J.-S. (2019). Solving linear programs with complementarity constraints using branch-and-cut. Mathematical Programming Computation, 11(2), 267–310. https://doi.org/10.1007/s12532-018-0149-2
   Web of Science ®Google Scholar
• Zhou, S., & Zemkoho, A. B. (2021). BiOpt: Bilevel optimization toolboxes (Tech. Rep.). https://biopt.github.io/files/menu-of-BiOpt.pdf
   Google Scholar