MIPLIB 2017 Infeas
334 linear programs with no optimal solution, each derived from a MIPLIB 2017 instance with its integrality dropped. 229 have no feasible point; 105 are unbounded. They run up to 20,682,487 variables and 19,912,111 constraints.
Primal-infeasible
A branch-and-bound run splits on a variable and explores one side of the split. This set collects the other side, at nodes where that side has no feasible point.
Browse them all →Dual-infeasible
A greedy search drops bounds and constraints from a feasible, bounded root relaxation until its objective is unbounded. 103 instances come from that search; the other 2 were unbounded as given.
Browse them all →Two files
The linear program, gzipped MPS, continuous variables only, ready to solve as published.
The provenance, JSON: the branch behind a primal-infeasible file, the relaxation behind a dual-infeasible one.
How to cite
author = {Haihao Lu and Bo Tang},
title = {MIPLIB 2017 Infeas: Primal- and Dual-Infeasible Linear Programs from MIPLIB 2017},
howpublished = {\url{https://mit-lu-lab.github.io/MIPLIB2017-Infeas/}},
year = {2026}
}
Every instance derives from MIPLIB 2017. Please also cite Gleixner et al., “MIPLIB 2017: Data-Driven Compilation of the 6th Mixed-Integer Programming Library”.
Contact
This collection is maintained by Haihao Lu and Bo Tang. If a published file does not have the status it claims, or a source instance carries terms other than the default, please open an issue and the affected file will be corrected or withdrawn.