Skip to content

FormuEvo: LLM-Guided Evolution for Discovering Solver-Efficient Mixed-Integer Programming Formulations

Aug 2026 · 0 citations · 50 references
Computer Science

TL;DR

A solver-informed diagnosis mechanism that exploits fine-grained solver statistics as verbal gradients for targeted refinement and a structured memory abstracts prior experience into reusable modeling strategies, avoiding redundant exploration while enabling zero-shot transfer to unseen problems and bootstrapping smaller LLMs.

Abstract

Mixed-integer programming (MIP) lies at the core of operations research and industrial optimization. While large language models (LLMs) have recently shown promise in automated MIP modeling from natural language, they prioritize semantic correctness but overlook formulation strength, severely bottlenecking the efficiency of downstream solvers. We propose FormuEvo, an LLM-guided evolutionary framework for automated discovery of solver-efficient MIP formulations. FormuEvo frames MIP formulation design as evolutionary optimization over the symbolic space of MIP formulations, represented as executable modeling programs, by iteratively generating, evaluating, and selecting stronger candidates via LLM-driven crossover, mutation, and repair operations. To move beyond blind exploration, FormuEvo introduces a solver-informed diagnosis mechanism that exploits fine-grained solver statistics as verbal gradients for targeted refinement. Additionally, a structured memory abstracts prior experience into reusable modeling strategies, avoiding redundant exploration while enabling zero-shot transfer to unseen problems and bootstrapping smaller LLMs. Experiments across diverse linear and non-linear problems demonstrate that FormuEvo discovers formulations that significantly outperform both expert-designed formulations and existing LLM-based approaches, accelerating solvers by up to 5.5$\times$, with distilled knowledge transferring effectively across problems and model scales.

View source

Similar papers

Jul 2026

LLM-Guided Evolutionary Search for Constraint Model Reformulation to Improve Solver Efficiency

Combinatorial problems appear in numerous industrial applications. A common approach is to formulate these problems as declarative constraint models that can subsequently be compiled to and solved by a range of back-end solvers. Recent work shows that Large Language Models (LLMs) can produce correct models from natural...

Kostis Michailidis, Dimos Tsouros, Dang Nguyen et al. · 0 citations
Preprint Jul 2026

IR2Solve: Structured Intermediate Representations for Cost-Efficient Optimization Autoformulation

Large language models (LLMs) can translate natural-language optimization problems into solver-ready formulations, but direct code generation is brittle: schema, indexing, and semantic errors can cause compilation failures, infeasible models, or incorrect objectives, while iterative repair, search, and multi-agent workf...

Penglin Zhu, Linhai Zhang, Jungang Xu et al. · 0 citations
Conference Open access 2026

Uncertainty-Aware Test-Time Search for Optimization Problem Solving

UMCTS is an Uncertainty-aware Monte Carlo Tree Search framework that combines the language understanding capability of large language models with the reliability of well-established solvers and achieves state-of-the-art solution accuracy and improves efficiency by reducing token usage.

Linlin Yu, Xujiang Zhao, Dong Li et al. · 0 citations
May 2026

MILP-Evo: Closed-Loop Fully Automatic Design of MILP Solvers

Machine learning methods have shown that data-driven policies can accelerate mixed-integer linear programming (MILP) solvers, but many such approaches remain difficult to inspect, adapt, and deploy because the learned policy is represented as an external predictor or other opaque model. By contrast, explicit solver log...

Jinbiao Nie, Kewei Feng, Xiaoyuan Zhang et al. · 0 citations
Book Open access Jul 2026

LLM-Driven Configuration of Genetic Algorithms for Constraint-Rich Optimization Problems

A framework that combines large language models (LLMs) for problem understanding with a structured Biased Random-Key Genetic Algorithm (BRKGA) configurator for algorithm realization is presented, allowing users to describe optimization problems in natural language and receive executable GPU-accelerated GA implementatio...

Harishjitu Seesandrn, M. Sodhi, Resit Sendag · 0 citations
Conference Open access Sep 2026

LLM-guided Cutting-plane Management for Mixed-integer Linear Programming

This work proposes an LLM-guided cutting-plane management framework that removes dependence on domain-specific training data and substantially reduces reliance on expert-crafted configurations.

Zetao Zheng, Zhe Wang, Jie Shao · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 24, 2026

Estimating suicide risk from text

A new language-processing tool could help identify the highest-risk individuals from natural language, enabling swifter interventions.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.