| Name | ex9 |
| Download | ex9.mps.gz |
| Solution | ex9.sol.gz |
| Set Membership | Benchmark Primal |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | I. Ober |
| Rows | 40962 |
| Cols | 10404 |
| Num. non-zeros in A | 517112 |
| Num. non-zeros in c | 10404 |
| Rows/Cols | 3.93713956171 |
| Integers | |
| Binaries | 10404 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 81 |
| LP Objective | 81 |
| Aggregation | |
| Variable Bound | 1152 |
| Set partitioning | 162 |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 38528 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |
Formulations of Boolean SAT instance