fhnw-schedule-paira200

dual-infeasible

The instance

as published

Variables: 20,300
Constraints: 40,000
Nonzeros: 119,746
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: 201
Rows dropped: 0

What was removed

201 entries

lb of C232lb of C394lb of C325lb of C374lb of C229lb of C221lb of C312lb of C368lb of C208lb of C214lb of C336lb of C378

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

Download

fhnw-schedule-paira200_ub.mps.gz0.66 MiB fhnw-schedule-paira200_ub.meta.json66 KiB

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

Source instance

Namefhnw-schedule-paira200

Submitted bySimon Felix

Groupschedule

TermsCC BY-SA 4.0

variable_bound

Continuous-time project scheduling and selection, inspired by an industry use-case. Each project has a value, the sum should be maximized. Each project has a deadline, and an earliest start date. Three formulations of the same problem (“Pair A”, “Pair B” and “Slot”) - we expect “Pair B” to be the best formulation.

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

View on MIPLIB 2017 →