A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. I: Key ideas and a fixed parameter setting

DOI10.1007/978-3-031-24907-5_17MaRDI QIDQ6606534FDO

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

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

Recommendations

• A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results
• An objective penalty function of bilevel programming
• Double penalty method for bilevel optimization problems
• Global solution of nonlinear mixed-integer bilevel programs
• The branch and bound method for a quadratic problem of bilevel programming

Cites work

• A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A survey of network interdiction models and algorithms
• A survey on mixed-integer programming techniques in bilevel optimization
• Is bilevel programming a special case of a mathematical program with complementarity constraints?
• New Branch-and-Bound Rules for Linear Bilevel Programming

Cited in

(1)

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

This page was built for publication: A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. I: Key ideas and a fixed parameter setting

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