Sparsity pattern

uc-case3

Nameuc-case3
Downloaduc-case3.mps.gz
Solutionuc-case3.sol.gz
Set Membership Challenge
Problem StatusHard
Problem FeasibilityFeasible
Originator/ContributorD. Espinoza
Rows52003
Cols37749
Num. non-zeros in A273618
Num. non-zeros in c14436
Rows/Cols1.37759940661
Integers
Binaries11256
Continuous26493
min nonzero |Aij|0.044
max |Aij|368
min nonzero |cj|0.01349
max |cj|14.5728
Integer Objective7204.918769
LP Objective7181.264177
Aggregation9525
Variable Bound25541
Set partitioning
Set packing
Set covering
Cardinality
Equality Knapsacks
Bin packing
Invariant Knapsack
Knapsacks
Integer Knapsack
Mixed 0/111359
General Cons.
References

Unit commitment problems (electricity production planning problems) coming from the Chilean electricity system, they have either one or two week planning horizons, and include constraints on minimum on-off time for the power plants, ensure some reserve energy in the system, and minimize global operation costs. Solved with Gurobi 5.0 in 158881 seconds (May 2012).


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