| Name | dg012142 |
| Download | dg012142.mps.gz |
| Solution | dg012142.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Miller |
| Rows | 6310 |
| Cols | 2080 |
| Num. non-zeros in A | 14795 |
| Num. non-zeros in c | 1440 |
| Rows/Cols | 3.03365384615 |
| Integers | |
| Binaries | 640 |
| Continuous | 1440 |
| min nonzero |Aij| | 1 |
| max |Aij| | 7173 |
| min nonzero |cj| | 1 |
| max |cj| | 10000 |
| Integer Objective | 2300867 |
| LP Objective | 757818.480114 |
| Aggregation | 6 |
| Variable Bound | 701 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1390 |
| General Cons. | |
| References |