| Name | neos-826841 |
| Download | neos-826841.mps.gz |
| Solution | neos-826841.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 2354 |
| Cols | 5516 |
| Num. non-zeros in A | 18460 |
| Num. non-zeros in c | 1952 |
| Rows/Cols | 0.426758520667 |
| Integers | |
| Binaries | 3488 |
| Continuous | 2028 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 0.0002 |
| max |cj| | 1 |
| Integer Objective | 29.0082 |
| LP Objective | 28.0082 |
| Aggregation | 48 |
| Variable Bound | |
| Set partitioning | 18 |
| Set packing | |
| Set covering | |
| Cardinality | 42 |
| Equality Knapsacks | |
| Bin packing | 320 |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1926 |
| General Cons. | |
| References |