proteindesign121pgb11p9

dual-infeasible

The instance

as published

Variables: 132,672
Constraints: 254
Nonzeros: 524,690
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: 6
Rows dropped: 0

What was removed

6 entries

lb of X_INTRODUCED_384550_lb of X_INTRODUCED_63_lb of objectiveub of X_INTRODUCED_385463_ub of X_INTRODUCED_385471_ub of X_INTRODUCED_386769_

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

Also published in the primal-infeasible set view →

Download

proteindesign121pgb11p9_ub.mps.gz2.24 MiB proteindesign121pgb11p9_ub.meta.json6 KiB

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

Source instance

Nameproteindesign121pgb11p9

Submitted byGleb Belov

Groupproteindesign

TermsCC BY-SA 4.0

general_linearset_partitioning

Linearized Constraint Programming models of the MiniZinc Challenges 2012-2016. I should be able to produce versions with indicator constraints supported by Gurobi and CPLEX, however don’t know if you can use them and if there is a standard format. These MPS were produced by Gurobi 7.0.2 using the MiniZinc develop branch on eb536656062ca13325a96b5d0881742c7d0e3c38

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

View on MIPLIB 2017 →