| Name | probportfolio |
| Download | probportfolio.mps.gz |
| Solution | probportfolio.sol.gz |
| Set Membership | Challenge |
| Problem Status | Hard |
| Problem Feasibility | Feasible |
| Originator/Contributor | S. Ahmed, S. Dey, F. Qiu |
| Rows | 302 |
| Cols | 320 |
| Num. non-zeros in A | 6620 |
| Num. non-zeros in c | 20 |
| Rows/Cols | 0.94375 |
| Integers | |
| Binaries | 300 |
| Continuous | 20 |
| min nonzero |Aij| | 0.800008 |
| max |Aij| | 1.4996 |
| min nonzero |cj| | 5 |
| max |cj| | 48 |
| Integer Objective | 16.734246764 |
| LP Objective | 5 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 301 |
| General Cons. | |
| References |