| Name | binkar10_1 |
| Download | binkar10_1.mps.gz |
| Solution | binkar10_1.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | H. Mittelmann |
| Rows | 1026 |
| Cols | 2298 |
| Num. non-zeros in A | 4496 |
| Num. non-zeros in c | 1742 |
| Rows/Cols | 0.446475195822 |
| Integers | |
| Binaries | 170 |
| Continuous | 2128 |
| min nonzero |Aij| | 1 |
| max |Aij| | 28.81 |
| min nonzero |cj| | 0.83 |
| max |cj| | 1000000 |
| Integer Objective | 6742.200024 |
| LP Objective | 6637.188027 |
| Aggregation | 200 |
| Variable Bound | |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 826 |
| General Cons. | |
| References |
Relaxed version of problem binkar10