Presolving linear bilevel optimization problems

DOI10.1016/J.EJCO.2021.100020zbMath1530.90009OpenAlexW3212049456MaRDI QIDQ6169995

Julian Manns, Thomas Kleinert, Martin Schmidt, Dieter Weninger

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejco.2021.100020

zbMATH Keywords

computational analysispresolvelinear bilevel optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonlinear programming (90C30) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Unnamed Item
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Three enhancements for optimization-based bound tightening
• A note on detecting simple redundancies in linear systems
• Progress in presolving for mixed integer programming
• Practical bilevel optimization. Algorithms and applications
• Descent approaches for quadratic bilevel programming
• Dependence of bilevel mathematical programs on irrelevant constraints
• Foundations of bilevel programming
• A dynamic reformulation heuristic for generalized interdiction problems
• On the use of intersection cuts for bilevel optimization
• Presolving in linear programming
• A branch-and-reduce approach to global optimization
• Closing the gap in linear bilevel optimization: a new valid primal-dual inequality
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• New branch-and-Cut algorithm for bilevel linear programming
• Feasibility-Based Bounds Tightening via Fixed Points
• Presolve Reductions in Mixed Integer Programming
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A Representation and Economic Interpretation of a Two-Level Programming Problem
• New Branch-and-Bound Rules for Linear Bilevel Programming
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs
• Technical Note—There’s No Free Lunch: On the Hardness of Choosing a Correct Big-M in Bilevel Optimization
• The Mixed Integer Linear Bilevel Programming Problem

This page was built for publication: Presolving linear bilevel optimization problems