Journal article · 2025 · Open access
Tight mixed-integer optimization formulations for prescriptive trees
Machine Learning, 114(7), 156 · Published 29 May 2025 · DOI 10.1007/s10994-025-06771-8
In brief
“Tight mixed-integer optimization formulations for prescriptive trees” is a 2025 journal article by Max Biggs and Georgia Perakis, published in Machine Learning. OpenAlex counts 3 citations as of 21 November 2026. It is open access under a CC BY licence: the full text is free to read at Machine Learning.
- Citations
- 3
- Most cited in
- 2026 (2)
- Field-weighted impact
- 1.36
- References
- 52
- Authors
- 2
Abstract
We focus on modeling the relationship between an input feature vector and the predicted outcome of a trained decision tree using mixed-integer optimization. This can be used in many practical applications where a decision tree or a tree ensemble is incorporated into an optimization problem to model the predicted outcomes of a decision. We propose novel tight mixed-integer optimization formulations for this problem. Existing formulations can be shown to have linear relaxations that have fractional extreme points, even for the simple case of modeling a single decision tree or a very large number of constraints, which leads to slow solve times in practice. A formulation we propose, based on a projected union of polyhedra approach, is ideal (i.e., the extreme points of the linear relaxation are integer when required) for a single decision tree. Although the formulation is generally not ideal for tree ensembles, it generally has fewer extreme points, leading to a faster time to solve. We also study formulations with a binary representation of the feature vector and present multiple approaches to tighten existing formulations. We show that fractional extreme points are removed when multiple splits are on the same feature. At an extreme, we prove that this results in an ideal formulation for a tree ensemble modeling a one-dimensional feature vector. Building on this result, we also show that these additional constraints result in significantly tighter linear relaxations when the feature vector is low dimensional.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Biggs, M., & Perakis, G. (2025). Tight mixed-integer optimization formulations for prescriptive trees. Machine Learning, 114(7), 156. https://doi.org/10.1007/s10994-025-06771-8
MLA 9
Biggs, Max, and Georgia Perakis. “Tight mixed-integer optimization formulations for prescriptive trees.” Machine Learning, vol. 114, no. 7, 2025, p. 156. https://doi.org/10.1007/s10994-025-06771-8.
Chicago
Biggs, Max and Georgia Perakis. 2025. “Tight mixed-integer optimization formulations for prescriptive trees.” Machine Learning 114 (7): 156. https://doi.org/10.1007/s10994-025-06771-8.
Harvard
Biggs, M. and Perakis, G. (2025) ‘Tight mixed-integer optimization formulations for prescriptive trees’, Machine Learning, 114(7), p. 156. doi:10.1007/s10994-025-06771-8.
IEEE
M. Biggs and G. Perakis, “Tight mixed-integer optimization formulations for prescriptive trees,” Machine Learning, vol. 114, no. 7, p. 156, 2025, doi: 10.1007/s10994-025-06771-8.
BibTeX
@article{biggs2025tight,
title = {{Tight mixed-integer optimization formulations for prescriptive trees}},
author = {Biggs, Max and Perakis, Georgia},
journal = {Machine Learning},
year = {2025},
volume = {114},
number = {7},
pages = {156},
doi = {10.1007/s10994-025-06771-8},
url = {https://doi.org/10.1007/s10994-025-06771-8}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- prescriptive analytics
- decision tree
- decision tree ensembles
- mixed integer programming
- linear programming relaxation
- low-dimensional feature vectors
Work with this paper
Most-cited papers in Mathematics
- Random ForestsLeo Breiman · Machine Learning · 2001 · 142,830 citations
- Controlling the False Discovery Rate: A Practical and Powerful Approach to Multiple TestingYoav Benjamini, Yosef Hochberg · Journal of the Royal Statistical Society Series B (Statistical Methodology) · 1995 · 113,923 citations
- Fitting Linear Mixed-Effects Models Using lme4Douglas M. Bates, Martin Maechler, Benjamin M. Bolker and 1 more · Journal of Statistical Software · 2015 · 100,328 citations
- The moderator-mediator variable distinction in social psychological research: Conceptual, strategic, and statistical considerations.Reuben M. Baron, David A. Kenny · Journal of Personality and Social Psychology · 1986 · 95,866 citations
- Using multivariate statisticsBarbara Gerson Tabachnick, Linda S. Fidell · 1983 · 79,867 citations
Questions about this paper
How do I cite this paper in APA style?
Biggs, M., & Perakis, G. (2025). Tight mixed-integer optimization formulations for prescriptive trees. Machine Learning, 114(7), 156. https://doi.org/10.1007/s10994-025-06771-8
How many times has this paper been cited?
3 times, according to OpenAlex on 21 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at Machine Learning: sign in and open the PDF from this page.
Who wrote this paper?
Max Biggs, Georgia Perakis.
What is the DOI of this paper?
10.1007/s10994-025-06771-8, permanently at https://doi.org/10.1007/s10994-025-06771-8. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 21 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.