| Name | n9-3 |
| Download | n9-3.mps.gz |
| Solution | n9-3.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk |
| Rows | 2364 |
| Cols | 7644 |
| Num. non-zeros in A | 30072 |
| Num. non-zeros in c | 7560 |
| Rows/Cols | 0.309262166405 |
| Integers | 252 |
| Binaries | |
| Continuous | 7392 |
| min nonzero |Aij| | 1 |
| max |Aij| | 255 |
| min nonzero |cj| | 1 |
| max |cj| | 300 |
| Integer Objective | 14409 |
| LP Objective | 7889.705882 |
| Aggregation | 176 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2020 |
| General Cons. | 168 |
| References |