rvb-sub

dual-infeasible

The instance

as published

Variables: 33,765
Constraints: 171
Nonzeros: 653,992
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: 121
Rows dropped: 54

What was removed

175 entries

lb of c6417row mindt0lb of c50578lb of c33610lb of c23030row s83lb of c47945lb of c26755lb of c15795row s30lb of c50023lb of c28653

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

Also published in the primal-infeasible set view →

Download

rvb-sub_ub.mps.gz2.07 MiB rvb-sub_ub.meta.json39 KiB

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

Source instance

Namervb-sub

Submitted byS. Weider

TermsNo licence of record

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

knapsackset_partitioning

Set partitioning instance resulting from a column generation algorithm used for duty scheduling in public transportation

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

View on MIPLIB 2017 →