| Name | neos-1396125 |
| Download | neos-1396125.mps.gz |
| Solution | neos-1396125.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1494 |
| Cols | 1161 |
| Num. non-zeros in A | 5511 |
| Num. non-zeros in c | 258 |
| Rows/Cols | 1.28682170543 |
| Integers | |
| Binaries | 129 |
| Continuous | 1032 |
| min nonzero |Aij| | 1 |
| max |Aij| | 250 |
| min nonzero |cj| | 0.002777778 |
| max |cj| | 1000 |
| Integer Objective | 3000.045337302 |
| LP Objective | 388.5524 |
| Aggregation | |
| Variable Bound | 864 |
| Set partitioning | 3 |
| Set packing | 6 |
| Set covering | |
| Cardinality | 18 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 3 |
| Knapsacks | 3 |
| Integer Knapsack | |
| Mixed 0/1 | 597 |
| General Cons. | |
| References |