| Name | eilA101-2 |
| Download | eilA101-2.mps.gz |
| Solution | eilA101-2.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | J. Linderoth |
| Rows | 100 |
| Cols | 65832 |
| Num. non-zeros in A | 959373 |
| Num. non-zeros in c | 65832 |
| Rows/Cols | 0.0015190181067 |
| Integers | |
| Binaries | 65832 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 8.944272 |
| max |cj| | 405.1038 |
| Integer Objective | 880.920108 |
| LP Objective | 803.373888 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 100 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |