Sparsity pattern

a1c1s1

Namea1c1s1
Downloada1c1s1.mps.gz
Solutiona1c1s1.sol.gz
Set Membership Challenge
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorM. Vyve, Y. Pochet
Rows3312
Cols3648
Num. non-zeros in A10178
Num. non-zeros in c1440
Rows/Cols0.907894736842
Integers
Binaries192
Continuous3456
min nonzero |Aij|1
max |Aij|480
min nonzero |cj|0.0225
max |cj|250
Integer Objective11503.444125
LP Objective997.529583
Aggregation6
Variable Bound1968
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/11338
General Cons.
References FischettiLodi2003 PochetVyve2004

Lot sizing instance. Alkis Vazacopoulos reports solving this instance using XPRESS 2006B.


Last Update December 6, 2016 by Gerald Gamrath
© 2016 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint