EQUIVAMAP: LEVERAGING LLMS FOR AUTOMATIC EQUIVALENCE CHECKING OF OPTIMIZATION FORMULATIONS

作     者：Zhai, Haotian Lawless, Connor Vitercik, Ellen Leqi, Liu 

作者机构：The University of Texas Austin United States Stanford University United States 

出 版 物：《arXiv》 (arXiv)

年 卷 期：2025年

核心收录：

主　　题：Mixed integer linear programming 

摘      要：A fundamental problem in combinatorial optimization is identifying equivalent formulations, which can lead to more efficient solution strategies and deeper insights into a problem’s computational complexity. The need to automatically identify equivalence between problem formulations has grown as optimization copilots—systems that generate problem formulations from natural language descriptions—have proliferated. However, existing approaches to checking formulation equivalence lack grounding, relying on simple heuristics which are insufficient for rigorous validation. Inspired by Karp reductions, in this work we introduce quasi-Karp equivalence, a formal criterion for determining when two optimization formulations are equivalent based on the existence of a mapping between their decision variables. We propose EquivaMap, a framework that leverages large language models to automatically discover such mappings, enabling scalable and reliable equivalence verification. To evaluate our approach, we construct the first open-source dataset of equivalent optimization formulations, generated by applying transformations such as adding slack variables or valid inequalities to existing formulations. Empirically, EquivaMap significantly outperforms existing methods, achieving substantial improvements in correctly identifying formulation equivalence.2 © 2025, CC BY-NC-ND.