| Name | neos-826650 |
| Download | neos-826650.mps.gz |
| Solution | neos-826650.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 2414 |
| Cols | 5912 |
| Num. non-zeros in A | 20440 |
| Num. non-zeros in c | 32 |
| Rows/Cols | 0.408322056834 |
| Integers | |
| Binaries | 5792 |
| Continuous | 120 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 29 |
| LP Objective | 28 |
| Aggregation | 48 |
| Variable Bound | |
| Set partitioning | 18 |
| Set packing | 320 |
| Set covering | |
| Cardinality | 1578 |
| Equality Knapsacks | |
| Bin packing | 320 |
| Invariant Knapsack | 10 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 120 |
| General Cons. | |
| References |