Sparsity pattern

binkar10_1

Namebinkar10_1
Downloadbinkar10_1.mps.gz
Solutionbinkar10_1.sol.gz
Set Membership Benchmark
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorH. Mittelmann
Rows1026
Cols2298
Num. non-zeros in A4496
Num. non-zeros in c1742
Rows/Cols0.446475195822
Integers
Binaries170
Continuous2128
min nonzero |Aij|1
max |Aij|28.81
min nonzero |cj|0.83
max |cj|1000000
Integer Objective6742.200024
LP Objective6637.188027
Aggregation200
Variable Bound
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/1826
General Cons.
References

Relaxed version of problem binkar10


Last Update February 28, 2017 by Gerald Gamrath
© 2017 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)
Imprint