On coupling constraints in pessimistic linear bilevel optimization

DOI10.1007/S10957-026-03026-XMaRDI QIDQ7306945zbMATH OpenFDO

Authors Dorothee Henke, Henri Lefebvre, Martin Schmidt, Johannes Thürauf

Publication date 31 July 2026

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10957-026-03026-X

Mathematics Subject Classification ID

Nonlinear programming (90C30) Hierarchical games (including Stackelberg games) (91A65)

Cites work

• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem
• A survey on bilevel optimization under uncertainty
• A tutorial on properties of the epigraph reformulation
• Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Discrete linear bilevel programming problem
• Foundations of bilevel programming
• scientific article; zbMATH DE number 7005721 (Why is no real title available?)
• scientific article; zbMATH DE number 2246593 (Why is no real title available?)
• Is pessimistic bilevel programming a special case of a mathematical program with complementarity constraints?
• Links between linear bilevel and mixed 0-1 programming problems
• Mathematical Programs with Optimization Problems in the Constraints
• Necessary optimality conditions in pessimistic bilevel programming
• On coupling constraints in linear bilevel optimization
• On the structure and properties of a linear multilevel programming problem
• Pessimistic bilevel optimization
• Two-Level Linear Programming

This page was built for publication: On coupling constraints in pessimistic linear bilevel optimization

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