Benders Subproblem Decomposition for Bilevel Problems with Convex Follower

DOI10.1287/IJOC.2021.1128MaRDI QIDQ5087737zbMATH OpenOpenAlexFDO

Authors Geunyeong Byeon, Pascal Van Hentenryck

Publication date 1 July 2022

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1902.04375

zbMATH Keywords

bilevel optimizationhierarchical decision makingBenders decompositionmixed integer bilevel second-order cone programmingsequential market clearing

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• A bi-level programming model and solution algorithm for the location of logistics distribution centers
• A bilevel model of taxation and its application to optimal highway pricing
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A note on linearized reformulations for a class of bilevel linear integer problems
• A note on the selection of Benders' cuts
• A value-function-based exact approach for the bilevel mixed-integer programming problem
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Bilevel programming: a survey
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Enhanced exact algorithms for discrete bilevel linear problems
• Exact solution of the evasive flow capturing problem
• Foundations of bilevel programming
• Global optimization of multilevel electricity market models including network design and graph partitioning
• Integer Programming
• Intersection cuts for bilevel optimization
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• The polynomial hierarchy and a simple model for competitive analysis

Cited in

(3)

• On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs
• SOCP-based disjunctive cuts for a class of integer nonlinear bilevel programs
• Benders decomposition for variational inequalities

This page was built for publication: Benders Subproblem Decomposition for Bilevel Problems with Convex Follower

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