| Name | lotsize |
| Download | lotsize.mps.gz |
| Solution | lotsize.sol.gz |
| Set Membership | Challenge |
| Problem Status | Easy |
| Problem Feasibility | Feasible |
| Originator/Contributor | D. Gade, S. Küçükyavuz |
| Rows | 1920 |
| Cols | 2985 |
| Num. non-zeros in A | 6565 |
| Num. non-zeros in c | 2390 |
| Rows/Cols | 0.643216080402 |
| Integers | |
| Binaries | 1195 |
| Continuous | 1790 |
| min nonzero |Aij| | 1 |
| max |Aij| | 20019 |
| min nonzero |cj| | 1 |
| max |cj| | 45000 |
| Integer Objective | 1480195 |
| LP Objective | 348385.346551 |
| Aggregation | |
| Variable Bound | 1195 |
| Set partitioning | |
| Set packing | 120 |
| Set covering | |
| Cardinality | |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 5 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | 600 |
| General Cons. | |
| References |