ns1111636

dual-infeasible

The instance

as published

Variables: 360,822
Constraints: 13,893
Nonzeros: 567,642
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: 3
Rows dropped: 2

What was removed

5 entries

lb of C355357row R0032row R0025lb of C349290ub of C355358

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

Also published in the primal-infeasible set view →

Download

ns1111636_ub.mps.gz1.54 MiB ns1111636_ub.meta.json5 KiB

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

Source instance

Namens1111636

Submitted byNEOS Server Submission

Groupneos-pseudoapplication-67

TermsNo licence of record

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

decompositioninvariant_knapsackknapsackset_packingset_partitioning

Network routing problem. Solved in June 2013 by CPLEX 12.5.1 with 32 threads in about 102 hours.

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

View on MIPLIB 2017 →