REVIEW 7 cited by
OptiMUS: Scalable Optimization Modeling with (MI)LP Solvers and Large Language Models
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
abstract
Optimization problems are pervasive in sectors from manufacturing and distribution to healthcare. However, most such problems are still solved heuristically by hand rather than optimally by state-of-the-art solvers because the expertise required to formulate and solve these problems limits the widespread adoption of optimization tools and techniques. This paper introduces OptiMUS, a Large Language Model (LLM)-based agent designed to formulate and solve (mixed integer) linear programming problems from their natural language descriptions. OptiMUS can develop mathematical models, write and debug solver code, evaluate the generated solutions, and improve its model and code based on these evaluations. OptiMUS utilizes a modular structure to process problems, allowing it to handle problems with long descriptions and complex data without long prompts. Experiments demonstrate that OptiMUS outperforms existing state-of-the-art methods on easy datasets by more than $20\%$ and on hard datasets (including a new dataset, NLP4LP, released with this paper that features long and complex problems) by more than $30\%$.
Forward citations
Cited by 7 Pith papers
-
YUKTI: From Natural-Language Situations to Robust, Verifiable Decisions An Uncertainty-Typed Proposition IR, Assumption-Robust Pareto Frontiers, and a Regret Certificate
An uncertainty-typed proposition IR plus Assumption-Robust Pareto Frontiers (ARPF) with a regret certificate cuts held-out regret by >90% under misspecification and beats status-quo and naive rules on real marketing data.
-
Re-evaluating LLM-based Heuristic Search: A Case Study on the 3D Packing Problem
LLM-guided evolutionary search, aided by scaffolding and self-correction, discovered a 3D packing scoring function competitive with human heuristics, but the model invented no new algorithm structures and its results ...
-
Step-Opt: Boosting Optimization Modeling in LLMs through Iterative Data Synthesis and Structured Validation
Step-Opt, a LLaMA-3-8B model fine-tuned on iteratively evolved and stepwise-validated data, reports state-of-the-art accuracy on NL4OPT, MAMO, and IndustryOR.
-
Large Language Model-Driven Surrogate-Assisted Evolutionary Algorithm for Expensive Optimization
LLM-SAEA uses an LLM scoring expert and an LLM decision expert to dynamically select surrogate models and infill criteria, and it reports competitive results on expensive-optimization benchmarks, though the gain over ...
-
A Systematic Survey on Large Language Models for Evolutionary Optimization: From Modeling to Solving
A literature survey that classifies LLM-based optimization research into modeling and solving, with solving divided into LLMs as optimizers, low-level components, and high-level managers.
-
Large Language Models for Next-Generation Wireless Network Management: A Survey and Tutorial
A survey and tutorial that organizes LLM-enabled wireless network optimization into formulation, solution, and verification stages, with case studies drawn from the authors' own prior papers.
-
Decision Information Meets Large Language Models: The Future of Explainable Operations Research
An LLM framework that couples what-if analysis with graph edit distance on linear programs can generate more accurate and more detailed explanations for operations research queries than existing LLM baselines.
Discussion (0). Continue with ORCID to comment.