| Name | k16x240 |
| Download | k16x240.mps.gz |
| Solution | k16x240.sol.gz |
| Set Membership | Tree |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | F. Ortega, L. Wolsey |
| Rows | 256 |
| Cols | 480 |
| Num. non-zeros in A | 960 |
| Num. non-zeros in c | 480 |
| Rows/Cols | 0.533333333333 |
| Integers | |
| Binaries | 240 |
| Continuous | 240 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1000 |
| min nonzero |cj| | 1 |
| max |cj| | 996 |
| Integer Objective | 10674 |
| LP Objective | 2769.838 |
| Aggregation | |
| Variable Bound | 240 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 16 |
| General Cons. | |
| References |