| Name | pg |
| Download | pg.mps.gz |
| Solution | pg.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | M. Dawande |
| Rows | 125 |
| Cols | 2700 |
| Num. non-zeros in A | 5200 |
| Num. non-zeros in c | 2600 |
| Rows/Cols | 0.0462962962963 |
| Integers | |
| Binaries | 100 |
| Continuous | 2600 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1607 |
| min nonzero |cj| | 1 |
| max |cj| | 139 |
| Integer Objective | -8674.342607117 |
| LP Objective | -11824.657382 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 125 |
| General Cons. | |
| References |