FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving — mentioned by henryrobbins00

Fri, 04 Sep 2026 20:07:56 GMT

Back in February, I was talking with my PhD advisor about using Lean to formally verify automated optimization modeling outputs. It eventually turned into this paper [1]. It’s been truly incredible to see how much the frontier models have progressed in both autoformalization and automated theorem proving in the last six months. Back in February, it was cool to see them prove the validity of some simple cutting planes. Now it can churn out a min-cut max-flow duality formalization (not to mention FLT). Very exciting times! I’ll also share a Python package I wrote for automated theorem proving…

Paper and discussion history. A mention is not an endorsement.

FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving — HN submission

Thu, 27 Aug 2026 17:58:34 GMT

Flare: Verifying MILP Reformulations with LLM-Based Theorem Proving

2 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving · HackerPapers discussions

FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving — mentioned by henryrobbins00

FLARE: Verifying MILP Reformulations with LLM-Based Theorem Proving — HN submission