| Name | rmatr200-p5 |
| Download | rmatr200-p5.mps.gz |
| Solution | rmatr200-p5.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Krushinsky |
| Rows | 37617 |
| Cols | 37816 |
| Num. non-zeros in A | 113048 |
| Num. non-zeros in c | 37816 |
| Rows/Cols | 0.994737677174 |
| Integers | |
| Binaries | 200 |
| Continuous | 37616 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 4850 |
| Integer Objective | 4521 |
| LP Objective | 3283.653831 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 1 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 37616 |
| General Cons. | |
| References |