Name | sing359 |
Download | sing359.mps.gz |
Set Membership | Challenge Reoptimize |
Problem Status | Open |
Problem Feasibility | Feasible |
Originator/Contributor | D. Espinoza |
Rows | 437116 |
Cols | 713762 |
Num. non-zeros in A | 1975605 |
Num. non-zeros in c | 329849 |
Rows/Cols | 0.612411420053 |
Integers | |
Binaries | 674643 |
Continuous | 39119 |
min nonzero |Aij| | 0.044 |
max |Aij| | 434.8 |
min nonzero |cj| | 0.344956 |
max |cj| | 39970.27 |
Integer Objective | Unknown |
LP Objective | 22534478.962498 |
Aggregation | 29364 |
Variable Bound | 77566 |
Set partitioning | 37419 |
Set packing | |
Set covering | |
Cardinality | 292095 |
Equality Knapsacks | |
Bin packing | |
Invariant Knapsack | |
Knapsacks | |
Integer Knapsack | |
Mixed 0/1 | 672 |
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.