Benders Subproblem Decomposition for Bilevel Problems with Convex Follower

DOI10.1287/IJOC.2021.1128OpenAlexW4221015540MaRDI QIDQ5087737FDOQ5087737

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

• Foundations of bilevel programming
• The polynomial hierarchy and a simple model for competitive analysis
• Resolution method for mixed integer bi-level linear problems based on decomposition technique
• A note on the selection of Benders' cuts
• A bilevel model of taxation and its application to optimal highway pricing
• Title not available (Why is that?)
• 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
• A bi-level programming model and solution algorithm for the location of logistics distribution centers
• Enhanced exact algorithms for discrete bilevel linear problems
• Integer Programming
• Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
• Intersection cuts for bilevel optimization
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A value-function-based exact approach for the bilevel mixed-integer programming problem
• A note on linearized reformulations for a class of bilevel linear integer problems
• Global optimization of multilevel electricity market models including network design and graph partitioning
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• Exact solution of the evasive flow capturing problem
• Outer approximation for global optimization of mixed-integer quadratic bilevel problems

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)