cs.CLAug 24, 2026

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

Authors: Haofeng Yuan, Jianing Peng, Jieyi Bi, Ni Zhang, Shiji Song, Zhiguang Cao

Organizations: Department of Automation, BNRist, Tsinghua University · College of Computing and Data Science, Nanyang Technological University · School of Computing and Information Systems, Singapore Management University

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.

Figures & tables

Appendix figures & tables7 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving

    Aug 25, 2026Henry Robbins, Connor Lawless, Madeleine Udell +1Mixed-Integer Linear ProgrammingFormal Verification

  2. GRIMIP: A General Framework for Instance-Specific Configuration of MIP Solvers Using LLMs

    Jun 22, 2026Yidong Luo, Xuemin Chen, Chenguang Wang +3Surrogate-Assisted OptimizationMixed-Integer Linear Programming

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

    Jul 30, 2026Kostis Michailidis, Dimos Tsouros, Nguyen Dang +1Automated Heuristic DesignEvolutionary Optimization