eilA101-2

dual-infeasible

The instance

as published

Variables: 65,832
Constraints: 77
Nonzeros: 685,281
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: 78
Rows dropped: 23

What was removed

101 entries

lb of x35499lb of x62984lb of x46808lb of x23230lb of x20598lb of x18628lb of x21378lb of x48483lb of x50659lb of x50612lb of x65116lb of x38070

12 of 101 shown. The complete list is in the sidecar.

Also published in the primal-infeasible set view →

Download

eilA101-2_ub.mps.gz2.77 MiB eilA101-2_ub.meta.json26 KiB

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

Source instance

NameeilA101-2

Submitted byJ. Linderoth

Groupeil

TermsNo licence of record

Imported from MIPLIB2010. It predates MIPLIB's submission form, and the licence that form required. See LICENSE.

set_partitioning

Set partitioning problem approximation for capicated vehicle routing problem instance from TSPLIB

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

View on MIPLIB 2017 →