| Name | bnatt350 |
| Download | bnatt350.mps.gz |
| Solution | bnatt350.sol.gz |
| Set Membership | Benchmark Primal Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Akutsu |
| Rows | 4923 |
| Cols | 3150 |
| Num. non-zeros in A | 19061 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 1.56285714286 |
| Integers | |
| Binaries | 3150 |
| Continuous | |
| min nonzero |Aij| | 0.125 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 0 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | 1423 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 1773 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 1773 |
| General Cons. | |
| References |