| Name | neos-1225589 |
| Download | neos-1225589.mps.gz |
| Solution | neos-1225589.sol.gz |
| Set Membership | Unstable |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 675 |
| Cols | 1300 |
| Num. non-zeros in A | 2525 |
| Num. non-zeros in c | 1225 |
| Rows/Cols | 0.519230769231 |
| Integers | |
| Binaries | 650 |
| Continuous | 650 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1820964 |
| min nonzero |cj| | 1.33 |
| max |cj| | 345017600 |
| Integer Objective | 1231065191.85 |
| LP Objective | 200000000 |
| Aggregation | |
| Variable Bound | 650 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 25 |
| General Cons. | |
| References |