| Name | pg5_34 |
| Download | pg5_34.mps.gz |
| Solution | pg5_34.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Dawande |
| Rows | 225 |
| Cols | 2600 |
| Num. non-zeros in A | 7700 |
| Num. non-zeros in c | 2600 |
| Rows/Cols | 0.0865384615385 |
| Integers | |
| Binaries | 100 |
| Continuous | 2500 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1529 |
| min nonzero |cj| | 1 |
| max |cj| | 139 |
| Integer Objective | -14339.353446926 |
| LP Objective | -16646.586017 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 225 |
| General Cons. | |
| References |