Advertisement

From Mixed-Integer Linear to Mixed-Integer Bilevel Linear Programming

  • Matteo FischettiEmail author
Conference paper
Part of the Springer Proceedings in Mathematics & Statistics book series (PROMS, volume 217)

Abstract

Bilevel Optimization is a very challenging framework where two players (with different objectives) compete for the definition of the final solution. In this paper we address a generic mixed-integer bilevel linear program, i.e., a bilevel optimization problem where the objective functions and constraints are all linear, and some variables are required to take integer values. We briefly describe some main ingredients of a branch-and-cut general-purpose framework for the exact solution (under appropriate assumptions) of mixed-integer bilevel linear programs.

Notes

Acknowledgements

This research was partially supported by MiUR, Italy (PRIN2015 project) and by the Vienna Science and Technology Fund (WWTF) through project ICT15-014.

References

  1. 1.
    Balas, E.: Intersection cuts-a new type of cutting planes for integer programming. Op. Res. 19(1), 19–39 (1971)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Conforti, M., Cornuejols, G., Zambelli, G.: Integer Programming. Springer International Publishing (2014)Google Scholar
  3. 3.
    DeNegre, S.: Interdiction and discrete bilevel linear programming. In: PhD Thesis. Lehigh University (2011)Google Scholar
  4. 4.
    DeNegre, S., Ralphs, T.K.: A branch-and-cut algorithm for integer bilevel linear programs. In: Operations Research and Cyber-Infrastructure, pp. 65–78. Springer (2009)Google Scholar
  5. 5.
    Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Louveaux, Q., Skutella, M. (eds.) Integer Programming and Combinatorial Optimization: 18th International Conference, IPCO 2016, Liège, Belgium, June 1–3, 2016, Proceedings, Springer International Publishing, pp. 77–88. (2016) (Extended version mathematical programming)Google Scholar
  6. 6.
    Fischetti, M., Ljubić, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Operations ResearchGoogle Scholar
  7. 7.
    Kleniati, P.-M., Adjiman, C.S.: A generalization of the branch-and-sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems. Comput. Chem. Eng. 72, 373–386 (2015)CrossRefGoogle Scholar
  8. 8.
    Moore, J., Bard, J.: The mixed integer linear bilevel programming problem. Op. Res. 38(5), 911–921 (1990)CrossRefzbMATHMathSciNetGoogle Scholar
  9. 9.
  10. 10.
    Xu, P., Wang, L.: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Op. Res. 41, 309–318 (2014)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.DEIUniversity of PadovaPaduaItaly

Personalised recommendations