.png){kind=icon}
.png){kind=icon}
Return
Counterfactual explanations for linear optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2025.06.016.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Counterfactual explanations framework for explaining linear optimization problems. • Definition of three types of counterfactual explanations: relative, weak and strong. • Problem formulations to calculate all three types of CEs. • Under mild assumptions the relative CEs can be calculated efficiently. • Calculating weak/strong CEs is computationally hard.
Keywords:
Linear programming
Counterfactual explanations
Bilinear optimization
Inverse optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available