| Name | sp98ir |
| Download | sp98ir.mps.gz |
| Solution | sp98ir.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Goessens, S. v. Hoessel, L. Kroon |
| Rows | 1531 |
| Cols | 1680 |
| Num. non-zeros in A | 71704 |
| Num. non-zeros in c | 1680 |
| Rows/Cols | 0.91130952381 |
| Integers | 809 |
| Binaries | 871 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 570 |
| min nonzero |cj| | 492376.8 |
| max |cj| | 45578990 |
| Integer Objective | 219676790.4 |
| LP Objective | 216663444.589936 |
| Aggregation | |
| Variable Bound | 1194 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | 7 |
| Invariant Knapsack | |
| Knapsacks | 35 |
| Integer Knapsack | |
| Mixed 0/1 | 55 |
| General Cons. | 170 |
| References |