| Name | neos-916792 |
| Download | neos-916792.mps.gz |
| Solution | neos-916792.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1909 |
| Cols | 1474 |
| Num. non-zeros in A | 134442 |
| Num. non-zeros in c | 262 |
| Rows/Cols | 1.29511533243 |
| Integers | |
| Binaries | 717 |
| Continuous | 757 |
| min nonzero |Aij| | 0.01704 |
| max |Aij| | 1000 |
| min nonzero |cj| | 0.002109705 |
| max |cj| | 0.01269956 |
| Integer Objective | 31.870398371 |
| LP Objective | 26.203596 |
| Aggregation | |
| Variable Bound | 1643 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 264 |
| General Cons. | |
| References |