| Name | uc-case3 |
| Download | uc-case3.mps.gz |
| Solution | uc-case3.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Espinoza |
| Rows | 52003 |
| Cols | 37749 |
| Num. non-zeros in A | 273618 |
| Num. non-zeros in c | 14436 |
| Rows/Cols | 1.37759940661 |
| Integers | |
| Binaries | 11256 |
| Continuous | 26493 |
| min nonzero |Aij| | 0.044 |
| max |Aij| | 368 |
| min nonzero |cj| | 0.01349 |
| max |cj| | 14.5728 |
| Integer Objective | 7204.918769 |
| LP Objective | 7181.264177 |
| Aggregation | 9525 |
| Variable Bound | 25541 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 11359 |
| 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).