lr1dr04vc05v17a-t360

dual-infeasible

The instance

as published

Variables: 36,912
Constraints: 12,600
Nonzeros: 107,170
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: 3
Rows dropped: 0

What was removed

3 entries

lb of x_(0,17),(4,38),1,Termub of x_(-6,-1),(4,38),1,Termub of x_(0,17),(-6,360),1,Term

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

Also published in the primal-infeasible set view →

Download

lr1dr04vc05v17a-t360_ub.mps.gz1.04 MiB lr1dr04vc05v17a-t360_ub.meta.json61 KiB

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

Source instance

Namelr1dr04vc05v17a-t360

Submitted byDimitri Papageorgiou

Groupmaritime

TermsCC BY-SA 4.0

aggregationsgeneral_linearset_packingset_partitioningvariable_bound

Maritime Inventory Routing Problem Library - Group 2 Instances. These instances are available at https://mirplib.scl.gatech.edu/instances , along with a host of additional information such as the underlying data used to generate the model, best known upper and lower bounds, and more. There are three sets of 24 instances (for a total of 72 instances) with a planning horizon of 120, 180, and 360 time periods, respectively. As of March 2016, Cplex and Gurobi could only solve one or two to provably optimality in less than an hour.

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

View on MIPLIB 2017 →