| Name | neos-824695 |
| Download | neos-824695.mps.gz |
| Solution | neos-824695.sol.gz |
| Set Membership | Primal |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 9576 |
| Cols | 23970 |
| Num. non-zeros in A | 72590 |
| Num. non-zeros in c | 170 |
| Rows/Cols | 0.399499374218 |
| Integers | |
| Binaries | 8500 |
| Continuous | 15470 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 31 |
| LP Objective | 31 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | 14 |
| Set packing | |
| Set covering | |
| Cardinality | 35 |
| Equality Knapsacks | |
| Bin packing | 1190 |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 8337 |
| General Cons. | |
| References |