OptiVerse: A Comprehensive Benchmark towards Optimization Problem Solving

arXiv cs.CL / 4/24/2026

📰 NewsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper introduces OptiVerse, a new benchmark of 1,000 curated optimization problems across underrepresented areas like stochastic, dynamic, game optimization, and optimal control.
  • It evaluates 22 LLMs and finds steep accuracy drops on hard instances, with even top models (e.g., GPT-5.2 and Gemini-3) not exceeding 27% accuracy.
  • Error analysis indicates that modeling and logic mistakes are the main bottleneck limiting performance on these complex optimization tasks.
  • The authors propose a Dual-View Auditor Agent to enhance the LLMs’ modeling process while keeping additional time overhead minimal.
  • OptiVerse is positioned as a foundational platform to drive progress in using LLMs for complex optimization problem solving.

Abstract

While Large Language Models (LLMs) demonstrate remarkable reasoning, complex optimization tasks remain challenging, requiring domain knowledge and robust implementation. However, existing benchmarks focus narrowly on Mathematical Programming and Combinatorial Optimization, hindering comprehensive evaluation. To address this, we introduce OptiVerse, a comprehensive benchmark of 1,000 curated problems spanning neglected domains, including Stochastic Optimization, Dynamic Optimization, Game Optimization, and Optimal Control, across three difficulty levels: Easy, Medium, and Hard. The experiments with 22 LLMs of different sizes reveal sharp performance degradation on hard problems, where even advanced models like GPT-5.2 and Gemini-3 struggle to exceed 27% accuracy. Through error analysis, we identify that modeling & logic errors remain the primary bottleneck. Consequently, we propose a Dual-View Auditor Agent that improves the accuracy of the LLM modeling process without introducing significant time overhead. OptiVerse will serve as a foundational platform for advancing LLMs in solving complex optimization challenges.