A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results

DOI10.1007/978-3-031-24907-5_18MaRDI QIDQ6606535FDOQ6606535

Authors: Andreas Horländer, M. U. Schmidt 

Publication date: 17 September 2024

zbMATH Keywords

bilevel optimizationpenalty methodsbranch-and-boundmixed integer optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

Cites Work

• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• Why there is no need to use a big-\(M\) in linear bilevel optimization: a computational study of two ready-to-use approaches

This page was built for publication: A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606535)