| Name | rmatr100-p10 |
| Download | rmatr100-p10.mps.gz |
| Solution | rmatr100-p10.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Krushinsky |
| Rows | 7260 |
| Cols | 7359 |
| Num. non-zeros in A | 21877 |
| Num. non-zeros in c | 7359 |
| Rows/Cols | 0.986547085202 |
| Integers | |
| Binaries | 100 |
| Continuous | 7259 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 576 |
| Integer Objective | 423 |
| LP Objective | 360.593308 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 1 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 7259 |
| General Cons. | |
| References |