| Name | leo1 |
| Download | leo1.mps.gz |
| Solution | leo1.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | COR@L test set |
| Rows | 593 |
| Cols | 6731 |
| Num. non-zeros in A | 131218 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 0.088099836577 |
| Integers | |
| Binaries | 6730 |
| Continuous | 1 |
| min nonzero |Aij| | 1 |
| max |Aij| | 90382850 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 404227536.16 |
| LP Objective | 388573315.509608 |
| Aggregation | |
| Variable Bound | 26 |
| Set partitioning | |
| Set packing | 408 |
| Set covering | 16 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 69 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 140 |
| General Cons. | |
| References |