| Name | neos15 |
| Download | neos15.mps.gz |
| Solution | neos15.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 552 |
| Cols | 792 |
| Num. non-zeros in A | 1766 |
| Num. non-zeros in c | 552 |
| Rows/Cols | 0.69696969697 |
| Integers | |
| Binaries | 160 |
| Continuous | 632 |
| min nonzero |Aij| | 1 |
| max |Aij| | 999 |
| min nonzero |cj| | 1 |
| max |cj| | 10000 |
| Integer Objective | 80598.430096861 |
| LP Objective | 29624.693694 |
| Aggregation | 4 |
| Variable Bound | 240 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 308 |
| General Cons. | |
| References |