| Name | nu60-pr9 |
| Download | nu60-pr9.mps.gz |
| Solution | nu60-pr9.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk, D. Rajan |
| Rows | 2220 |
| Cols | 7350 |
| Num. non-zeros in A | 22176 |
| Num. non-zeros in c | 7350 |
| Rows/Cols | 0.302040816327 |
| Integers | 42 |
| Binaries | 7308 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 60 |
| min nonzero |cj| | 5 |
| max |cj| | 450 |
| Integer Objective | 24940 |
| LP Objective | 22850 |
| Aggregation | 174 |
| Variable Bound | 6 |
| Set partitioning | 14 |
| Set packing | |
| Set covering | |
| Cardinality | 1900 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 122 |
| References |