AI
LLM-based system OptiMUS automates modeling and solving complex optimization problems
A new modular architecture lets large language models convert natural language descriptions into executable optimization solutions, outperforming both direct prompting and fine-tuned specialists on real-world problems.
Most optimization challenges across manufacturing, logistics, and healthcare are tackled using ad-hoc methods rather than mathematically rigorous solvers—not because optimal solutions are impossible, but because the technical barrier to formulating and implementing them remains too high for most practitioners. A research effort from arXiv introduces OptiMUS-0.3, an LLM-powered system that bridges this gap by automating the entire workflow from natural language problem description to working code and verified solutions.
How the system works#
OptiMUS takes a plaintext description of an optimization problem and generates (mixed integer) linear programming formulations, solver code, and executable solutions. Rather than relying on a single monolithic prompt, the system employs a modular architecture that breaks problems into manageable chunks—critical for handling lengthy descriptions and complex datasets without prompt-length bottlenecks. The system also incorporates self-correction: it evaluates its own output, identifies errors, and iteratively refines both the mathematical model and the implementation code.
Performance gains#
Experimental results show OptiMUS-0.3 substantially outperforms naive prompting baselines—43% better on easier problems and 18% better on harder ones. More notably, on real-world case studies, the system succeeds where fine-tuned specialist models fail entirely, achieving 28.6% success versus zero for models trained on benchmark data alone. This suggests that modular design with error correction matters more than raw model capability.
Key insight#
A central finding challenges conventional thinking about scaling: system architecture drives performance more strongly than model sophistication. Researchers demonstrated that weaker models equipped with structured decomposition and targeted error correction can match stronger models run under naive prompting—and remain competitive with fine-tuned alternatives, all without the expense and complexity of retraining. The implication is that optimization practitioners who can describe their domain precisely now have a tool to accelerate the formulation and implementation pipeline, reducing friction in the adoption of formal optimization methods.

