Sparsity pattern

ran14x18-disj-8

Nameran14x18-disj-8
Downloadran14x18-disj-8.mps.gz
Solutionran14x18-disj-8.sol.gz
Set Membership Tree
Problem StatusEasy
Problem FeasibilityFeasible
Originator/ContributorJ. Aronson
Rows447
Cols504
Num. non-zeros in A10277
Num. non-zeros in c504
Rows/Cols0.886904761905
Integers
Binaries252
Continuous252
min nonzero |Aij|3.222851e-09
max |Aij|38
min nonzero |cj|1
max |cj|264
Integer Objective3712
LP Objective3444.421066
Aggregation
Variable Bound252
Set partitioning
Set packing
Set covering49
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack50
Knapsacks
Integer Knapsack
Mixed 0/1146
General Cons.
References SunAronsonMcKeownDrinka1998

Fixed charge transportation problem


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