| Name | neos13 |
| Download | neos13.mps.gz |
| Solution | neos13.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 20852 |
| Cols | 1827 |
| Num. non-zeros in A | 253842 |
| Num. non-zeros in c | 12 |
| Rows/Cols | 11.4132457581 |
| Integers | |
| Binaries | 1815 |
| Continuous | 12 |
| min nonzero |Aij| | 1.5e-05 |
| max |Aij| | 227.459 |
| min nonzero |cj| | 164.186 |
| max |cj| | 202.263 |
| Integer Objective | -95.474806559 |
| LP Objective | -126.178378 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 20852 |
| General Cons. | |
| References |