opm2-z8-s0

dual-infeasible

The instance

as published

Variables: 3,200
Constraints: 63,608
Nonzeros: 152,793
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: 2
Rows dropped: 0

What was removed

2 entries

lb of x398ub of x3053

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

Download

opm2-z8-s0_ub.mps.gz0.72 MiB opm2-z8-s0_ub.meta.json1 KiB

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

Source instance

Nameopm2-z8-s0

Submitted byDaniel Espinoza

Groupopm2

TermsNo licence of record

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

knapsackprecedence

Problems coming from precedence constrained knapsacks arising in mining applications. These are one-period problems with integer data but large root LP GAP

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

View on MIPLIB 2017 →