| Name | lrsa120 |
| Download | lrsa120.mps.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Infeasible |
| Originator/Contributor | M. Atlihan |
| Rows | 14521 |
| Cols | 3839 |
| Num. non-zeros in A | 39956 |
| Num. non-zeros in c | 3600 |
| Rows/Cols | 3.78249544152 |
| Integers | 119 |
| Binaries | 120 |
| Continuous | 3600 |
| min nonzero |Aij| | 1 |
| max |Aij| | 2 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | Infeasible |
| LP Objective | 29 |
| Aggregation | 2 |
| Variable Bound | 7200 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 7202 |
| General Cons. | 117 |
| References |
Model to break a 120 bit RSA key. Infeasibility proven by Gurobi 4.6.1 (12 threads) after about 38 hours (March 2012).