neos-506422
Name | neos-506422 |
Download | neos-506422.mps.gz |
Solution | neos-506422.sol.gz |
Set Membership |
Primal
|
Problem Status | Easy |
Problem Feasibility | Feasible |
Originator/Contributor | NEOS Server Submission |
Rows | 6811 |
Cols | 2527 |
Num. non-zeros in A | 31815 |
Num. non-zeros in c | 2268 |
Rows/Cols | 2.69529085873 |
Integers | |
Binaries | 63 |
Continuous | 2464 |
min nonzero |Aij| | 1 |
max |Aij| | 40 |
min nonzero |cj| | 1 |
max |cj| | 1 |
Integer Objective | 0 |
LP Objective | 0 |
Aggregation | |
Variable Bound | 2268 |
Set partitioning | 7 |
Set packing | |
Set covering | |
Cardinality | |
Equality Knapsacks | |
Bin packing | |
Invariant Knapsack | |
Knapsacks | |
Integer Knapsack | |
Mixed 0/1 | 4536 |
General Cons. | |
References |
|