| Name | rmatr200-p10 |
| Download | rmatr200-p10.mps.gz |
| Solution | rmatr200-p10.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Krushinsky |
| Rows | 35055 |
| Cols | 35254 |
| Num. non-zeros in A | 105362 |
| Num. non-zeros in c | 35254 |
| Rows/Cols | 0.994355250468 |
| Integers | |
| Binaries | 200 |
| Continuous | 35054 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 2424 |
| Integer Objective | 2017 |
| LP Objective | 1550.620783 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 1 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 35054 |
| General Cons. | |
| References |