| Name | ran16x16 |
| Download | ran16x16.mps.gz |
| Solution | ran16x16.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Aronson |
| Rows | 288 |
| Cols | 512 |
| Num. non-zeros in A | 1024 |
| Num. non-zeros in c | 512 |
| Rows/Cols | 0.5625 |
| Integers | |
| Binaries | 256 |
| Continuous | 256 |
| min nonzero |Aij| | 1 |
| max |Aij| | 54 |
| min nonzero |cj| | 1 |
| max |cj| | 262 |
| Integer Objective | 3823 |
| LP Objective | 3116.429512 |
| Aggregation | |
| Variable Bound | 256 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 32 |
| General Cons. | |
| References |