| Name | unitcal_7 |
| Download | unitcal_7.mps.gz |
| Solution | unitcal_7.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | R. O'Neill |
| Rows | 48939 |
| Cols | 25755 |
| Num. non-zeros in A | 127595 |
| Num. non-zeros in c | 9408 |
| Rows/Cols | 1.90017472335 |
| Integers | |
| Binaries | 2856 |
| Continuous | 22899 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 10 |
| max |cj| | 200000 |
| Integer Objective | 19635558.2440195 |
| LP Objective | 19387553.381271 |
| Aggregation | |
| Variable Bound | 30576 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 17455 |
| General Cons. | |
| References |
California seven day unit commitment problem