| Name | neos-820157 |
| Download | neos-820157.mps.gz |
| Set Membership | Infeasible Tree |
| Problem Status | Easy |
| Problem Feasibility | Infeasible |
| Originator/Contributor | NEOS Server Submission |
| Rows | 1015 |
| Cols | 1200 |
| Num. non-zeros in A | 4875 |
| Num. non-zeros in c | 0 |
| Rows/Cols | 0.845833333333 |
| Integers | |
| Binaries | 1200 |
| Continuous | |
| min nonzero |Aij| | 1 |
| max |Aij| | 1 |
| min nonzero |cj| | 0 |
| max |cj| | 0 |
| Integer Objective | Infeasible |
| LP Objective | 0 |
| Aggregation | |
| Variable Bound | 150 |
| Set partitioning | 105 |
| Set packing | 50 |
| Set covering | 685 |
| Cardinality | 15 |
| Equality Knapsacks | |
| Bin packing | |
| Invariant Knapsack | 695 |
| Knapsacks | |
| Integer Knapsack | |
| Mixed 0/1 | |
| General Cons. | |
| References |