| Name | bnatt400 |
| Download | bnatt400.mps.gz |
| Solution | bnatt400.sol.gz |
| Set Membership | Challenge Reoptimize |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | T. Akutsu |
| Rows | 5614 |
| Cols | 3600 |
| Num. non-zeros in A | 21698 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 1.55944444444 |
| Integers | |
| Binaries | 3600 |
| Continuous | |
| min nonzero |Aij| | 0.125 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 1 |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | 1614 |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 2014 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 2014 |
| General Cons. | |
| References |