| Name | neos-820146 |
| Download | neos-820146.mps.gz |
| Set Membership | Infeasible Tree |
| Problem Status | Easy |
| Problem Feasibility | Infeasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 830 |
| Cols | 600 |
| Num. non-zeros in A | 3225 |
| Num. non-zeros in c | 0 |
| Rows/Cols | 1.38333333333 |
| Integers | |
| Binaries | 600 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 0 |
| max |cj| | 0 |
| Integer Objective | Infeasible |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | |
| Set partitioning | |
| Set packing | 140 |
| Set covering | 675 |
| Cardinality | 15 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 675 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |