A Penalty Branch-and-Bound Method for Mixed-Integer Quadratic Bilevel Problems. Part II: Penalty Updates and Numerical Results | SpringerLink
Skip to main content

A Penalty Branch-and-Bound Method for Mixed-Integer Quadratic Bilevel Problems. Part II: Penalty Updates and Numerical Results

  • Conference paper
  • First Online:
Operations Research Proceedings 2022 (OR 2022)

Part of the book series: Lecture Notes in Operations Research ((LNOR))

Included in the following conference series:

  • 666 Accesses

Abstract

In the first part of this paper, we propose a penalty branch-and-bound method for solving bilevel problems with mixed-integer convex-quadratic upper level as well as convex-quadratic and continuous lower level and analyze the method for a fixed penalty parameter. In this second part, we extend the algorithm and its analysis towards iteratively adapted penalty parameters, prove the correctness of this extended method, and show its applicability by some first numerical results.

The first author thanks the DFG for their support within RTG 2126 “Algorithmic Optimization”. Both authors kindly acknowledge the support of RHRK.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 25167
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 31459
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 31459
Price includes VAT (Japan)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Horländer, A., & Schmidt, M. (2022). A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. Part I: Key ideas and a fixed parameter setting.

    Google Scholar 

  2. Kleinert, T., & Schmidt, M. (2023). Why there is no need to use a big-\(M\) in linear bilevel optimization: A computational study of two ready-to-use approaches. Computational Management Science.

    Google Scholar 

  3. 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.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Andreas Horländer .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Horländer, A., Schmidt, M. (2023). A Penalty Branch-and-Bound Method for Mixed-Integer Quadratic Bilevel Problems. Part II: Penalty Updates and Numerical Results. In: Grothe, O., Nickel, S., Rebennack, S., Stein, O. (eds) Operations Research Proceedings 2022. OR 2022. Lecture Notes in Operations Research. Springer, Cham. https://doi.org/10.1007/978-3-031-24907-5_18

Download citation

Publish with us

Policies and ethics