| Name | mik-250-1-100-1 |
| Download | mik-250-1-100-1.mps.gz |
| Solution | mik-250-1-100-1.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | A. Atamtürk |
| Rows | 151 |
| Cols | 251 |
| Num. non-zeros in A | 5351 |
| Num. non-zeros in c | 251 |
| Rows/Cols | 0.601593625498 |
| Integers | 150 |
| Binaries | 100 |
| Continuous | 1 |
| min nonzero |Aij| | 1 |
| max |Aij| | 1985 |
| min nonzero |cj| | 23 |
| max |cj| | 1790 |
| Integer Objective | -66729 |
| LP Objective | -79842.423635 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | 100 |
| References |