t1717

dual-infeasible

The instance

as published

Variables: 73,885
Constraints: 551
Nonzeros: 325,689
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: 5
Rows dropped: 0

What was removed

5 entries

lb of x2676lb of x28497lb of x28010ub of x55321ub of x56594

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

Also published in the primal-infeasible set view →

Download

t1717_ub.mps.gz1.79 MiB t1717_ub.meta.json20 KiB

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

Source instance

Namet1717

Submitted byR. Borndörfer

TermsNo licence of record

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

set_partitioning

Vehicle scheduling set partitioning problem from Berlin’s Telebus handicapped people’s transportation system Solution was computed with 12 Threads in 20 hours, by giving highest priority to variables with most edges in conflict graph.

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

View on MIPLIB 2017 →