Dear community,
I’m solving a MILP with CVX using gurobi. I would like to know how can I retrieve solutions from the solution pool?
Calling Gurobi 7.52: 1774 variables, 1308 equality constraints
Gurobi optimizer, licensed to CVX for CVX
Academic license - for non-commercial use only
Optimize a model with 1308 rows, 1774 columns and 4445 nonzeros
Variable types: 1743 continuous, 31 integer (30 binary)
Coefficient statistics:
Matrix range [5e-01, 2e+01]
Objective range [1e+00, 2e+00]
Bounds range [1e+00, 1e+00]
RHS range [5e-01, 1e+02]
Found heuristic solution: objective -20.0000000
Presolve removed 1 rows and 1308 columns
Presolve time: 0.01s
Presolved: 1307 rows, 466 columns, 3106 nonzeros
Variable types: 435 continuous, 31 integer (30 binary)
Root relaxation: objective -5.114000e+02, 690 iterations, 0.04 seconds
Nodes | Current Node | Objective Bounds | Work
Expl Unexpl | Obj Depth IntInf | Incumbent BestBd Gap | It/Node Time
0 0 -511.40000 0 30 -20.00000 -511.40000 2457% - 0s
H 0 0 -492.0000001 -511.40000 3.94% - 0s
0 0 -511.23333 0 30 -492.00000 -511.23333 3.91% - 0s
H 0 0 -493.0000001 -511.23333 3.70% - 0s
0 0 -511.14017 0 30 -493.00000 -511.14017 3.68% - 0s
H 0 0 -495.0000001 -511.14017 3.26% - 0s
0 0 -511.12722 0 30 -495.00000 -511.12722 3.26% - 0s
0 0 -511.12611 0 30 -495.00000 -511.12611 3.26% - 0s
0 0 -511.11351 0 30 -495.00000 -511.11351 3.26% - 0s
0 0 -511.09453 0 30 -495.00000 -511.09453 3.25% - 0s
0 0 -511.09161 0 30 -495.00000 -511.09161 3.25% - 0s
0 0 -511.09111 0 30 -495.00000 -511.09111 3.25% - 0s
0 0 -511.08115 0 30 -495.00000 -511.08115 3.25% - 0s
0 0 -511.07937 0 30 -495.00000 -511.07937 3.25% - 0s
0 0 -511.07720 0 30 -495.00000 -511.07720 3.25% - 0s
H 0 0 -499.0000001 -511.07720 2.42% - 0s
0 0 -511.07720 0 30 -499.00000 -511.07720 2.42% - 0s
0 0 -511.07057 0 30 -499.00000 -511.07057 2.42% - 0s
0 0 -511.02575 0 30 -499.00000 -511.02575 2.41% - 0s
0 0 -511.02522 0 30 -499.00000 -511.02522 2.41% - 0s
0 0 -511.02292 0 30 -499.00000 -511.02292 2.41% - 0s
0 0 -511.01538 0 30 -499.00000 -511.01538 2.41% - 0s
0 0 -511.01538 0 30 -499.00000 -511.01538 2.41% - 0s
0 0 -511.01538 0 30 -499.00000 -511.01538 2.41% - 0s
0 2 -511.01538 0 30 -499.00000 -511.01538 2.41% - 0s
Cutting planes:
Gomory: 2
MIR: 12
Explored 41 nodes (2124 simplex iterations) in 0.88 seconds
Thread count was 6 (of 6 available processors)
Solution count 5: -499 -495 -493 … -20
Optimal solution found (tolerance 1.00e-04)
Best objective -4.990000000574e+02, best bound -4.990000000574e+02, gap 0.0000%
Status: Solved
Optimal value (cvx_optval): +499
Thanks