Counterfactual explanations for linear optimization

DOI10.1016/J.EJOR.2025.06.016MaRDI QIDQ6859488zbMATH OpenFDO

Authors Jannis Kurtz, Şevket İlker Birbil, D. Den Hertog

Publication date 12 February 2026

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear programminginverse optimizationbilinear optimizationcounterfactual explanations

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2246593 (Why is no real title available?)
• A framework for inherently interpretable optimization models
• A reformulation-linearization-convexification algorithm for optimal correction of an inconsistent system of linear constraints
• A survey on mixed-integer programming techniques in bilevel optimization
• Automatic repair of convex optimization problems
• Bilevel programming problems. Theory, algorithms and applications to energy networks
• Branch-and-bound algorithms for the partial inverse mixed integer linear programming problem
• Counterfactual analysis and target setting in benchmarking
• Foundations of bilevel programming
• Mixed-integer optimization with constraint learning
• Objective-based counterfactual explanations for linear discrete optimization
• On the optimal correction of infeasible systems of linear inequalities
• Pessimistic bilevel optimization
• Safe Dike Heights at Minimal Costs: The Nonhomogeneous Case
• Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases

This page was built for publication: Counterfactual explanations for linear optimization

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