{
 "format_version": 1,
 "name": "MIPLIB 2017 Infeas",
 "description": "334 linear programs with no optimal solution, each derived from a MIPLIB 2017 instance with its integrality dropped. 229 have no feasible point, each from the unexplored side of a branch in a branch-and-bound search, and 105 have an unbounded objective. Of those, 103 come from removing an inclusion-minimal set of bounds and constraints from a feasible, bounded root relaxation; the other 2 were already unbounded. They run up to 20,682,487 variables and 19,912,111 constraints.",
 "url": "https://mit-lu-lab.github.io/MIPLIB2017-Infeas/",
 "release_base_url": "https://github.com/MIT-Lu-Lab/MIPLIB2017-Infeas/releases/download/v1.0/",
 "instances": 334,
 "subsets": [
  {
   "subset": "primal",
   "label": "Primal-infeasible",
   "count": 229,
   "index": "primal-infeasible.json",
   "csv": "primal-infeasible.csv"
  },
  {
   "subset": "dual",
   "label": "Dual-infeasible",
   "count": 105,
   "index": "dual-infeasible.json",
   "csv": "dual-infeasible.csv"
  }
 ],
 "sidecar_schema": "schema/sidecar/1.0.1/meta.schema.json",
 "notice": "LICENSE.txt"
}