| Name | bienst2 |
| Download | bienst2.mps.gz |
| Solution | bienst2.sol.gz |
| Set Membership | Benchmark |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | H. Mittelmann |
| Rows | 576 |
| Cols | 505 |
| Num. non-zeros in A | 2184 |
| Num. non-zeros in c | 1 |
| Rows/Cols | 1.14059405941 |
| Integers | |
| Binaries | 35 |
| Continuous | 470 |
| min nonzero |Aij| | 1 |
| max |Aij| | 81 |
| min nonzero |cj| | 1 |
| max |cj| | 1 |
| Integer Objective | 54.6 |
| LP Objective | 11.724138 |
| Aggregation | |
| Variable Bound | 448 |
| Set partitioning | |
| Set packing | |
| Set covering | |
| Cardinality | 5 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 123 |
| General Cons. | |
| References |
Relaxed version of problem bienst