thor50dday

dual-infeasible

The instance

as published

Variables: 106,261
Constraints: 53,360
Nonzeros: 212,060
Format: MPS, gzipped

Where it comes from

provenance

The source instance's LP relaxation is feasible with a bounded optimum. Removing the elements below makes the objective unbounded, and putting any one of them back makes it bounded again.

Bounds dropped: 7
Rows dropped: 0

What was removed

7 entries

lb of FlowVar0.25_205lb of FlowVar0.227_180lb of FlowVar0.29_115lb of FlowVar0.205_29lb of FlowVar0.115_227lb of EdgeVar227_180lb of FlowVar0.180_25

7 of 7 shown. The complete list is in the sidecar.

Also published in the primal-infeasible set view →

Download

thor50dday_ub.mps.gz1.47 MiB thor50dday_ub.meta.json14 KiB

The sidecar carries the full provenance, including the fields this page truncates.

Source instance

Namethor50dday

Submitted byDaniel Rehfeldt

TermsCC BY-SA 4.0

decompositionvariable_bound

Steiner tree problem in graphs instance, consisting of a complete graph with 231 vertices of which 50 are terminals. The vertices correspond to cities (mostly capitals) around the world, the edges weights correspond to the distances in km.

Source description quoted from MIPLIB 2017; links and mathematical notation formatted for the web.

View on MIPLIB 2017 →