Presolving linear bilevel optimization problems

DOI10.1016/J.EJCO.2021.100020zbMATH Open1530.90009OpenAlexW3212049456MaRDI QIDQ6169995FDOQ6169995

Authors: Thomas Kleinert, Julian Manns, 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

Recommendations

• A new general-purpose algorithm for mixed-integer bilevel linear programs
• Computational Difficulties of Bilevel Linear Programming
• Algorithms for Linear Bilevel Optimization
• Numerical solution of a linear bilevel problem
• BOLIB: bilevel Optimization LIBrary of test problems

zbMATH Keywords

computational analysispresolvelinear bilevel optimization

Mathematics Subject Classification ID

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

Cites Work

• Practical bilevel optimization. Algorithms and applications
• Foundations of bilevel programming
• New Branch-and-Bound Rules for Linear Bilevel 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-Cut algorithm for bilevel linear programming
• A branch-and-reduce approach to global optimization
• The Mixed Integer Linear Bilevel Programming Problem
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Descent approaches for quadratic bilevel programming
• A dynamic reformulation heuristic for generalized interdiction problems
• Feasibility-based bounds tightening via fixed points
• An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions
• Presolving in linear programming
• Title not available (Why is that?)
• A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation
• A note on detecting simple redundancies in linear systems
• Three enhancements for optimization-based bound tightening
• Progress in presolving for mixed integer programming
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• Presolve Reductions in Mixed Integer Programming
• Dependence of bilevel mathematical programs on irrelevant constraints
• On the use of intersection cuts for bilevel optimization
• Technical note -- There's no free lunch: on the hardness of choosing a correct big-\(M\) in bilevel 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

Cited In (4)

• The Linear-Quadratic Bilevel Programming Problem
• Solving ill-posed bilevel programs
• Efficiently solving linear bilevel programming problems using off-the-shelf optimization software
• Algorithms for Linear Bilevel Optimization

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

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