The branch and bound method for a quadratic problem of bilevel programming

MaRDI QIDQ3115614zbMATH OpenFDO

Authors M. S. Ershova

Publication date 10 February 2012

zbMATH Keywords

bilevel optimizationnonlinear programming

Mathematics Subject Classification ID

Quadratic programming (90C20)

Recommendations

• Global optimization algorithm for solving bilevel programming problems with quadratic lower levels
• scientific article; zbMATH DE number 1163114
• On the indefinite quadratic bilevel programming problem.
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A global optimization method for solving convex quadratic bilevel programming problems

Cited in

(4)

• Branch and cut method for solving integer indefinite quadratic bilevel programs
• Bilevel optimization: theory, algorithms, applications and a bibliography
• A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. I: Key ideas and a fixed parameter setting
• A penalty branch-and-bound method for mixed-integer quadratic bilevel problems. II: Penalty updates and numerical results

This page was built for publication: The branch and bound method for a quadratic problem of bilevel programming

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