neos-954925

dual-infeasible

The instance

as published

Variables: 84,718
Constraints: 2,661
Nonzeros: 706,489
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: 172
Rows dropped: 328

What was removed

500 entries

row R1111row R1085row R0092row R1080row R0121row R2466row R0113ub of C84568row R0110row R0101row R0045row R2382

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

Download

neos-954925_ub.mps.gz2.42 MiB neos-954925_ub.meta.json0.11 MiB

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

Source instance

Nameneos-954925

Submitted byNEOS Server Submission

Groupneos-pseudoapplication-48

TermsNo licence of record

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

binpackinginvariant_knapsackknapsackprecedenceset_packing

The instance was solved using up to 40 threads in 120 sec. using Gurobi 9.0

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

View on MIPLIB 2017 →