| Name | app1-2 |
| Download | app1-2.mps.gz |
| Solution | app1-2.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | E. Danna |
| Rows | 53467 |
| Cols | 26871 |
| Num. non-zeros in A | 199175 |
| Num. non-zeros in c | 266 |
| Rows/Cols | 1.98976591865 |
| Integers | |
| Binaries | 13300 |
| Continuous | 13571 |
| min nonzero |Aij| | 1e-05 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | -41 |
| LP Objective | -264.601651 |
| Aggregation | |
| Variable Bound | 13300 |
| Set partitioning | |
| Set packing | |
| Set covering | 266 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 266 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 39895 |
| General Cons. | |
| References |
Undisclosed industrial application from Google