I've got this log output from cplex showing that an optimal solution is found at the root node, but cplexstatus = 2 (unbound). Where did it go wrong? How do I get the integer solution found at the root?

Thanks.

Tried aggregator 2 times.

...

Tried aggregator 3 times.

...

MIP emphasis: balance optimality and feasibility.

MIP search method: dynamic search.

Parallel mode: deterministic, using up to 8 threads.

Root relaxation solution time = 0.20 sec. (60.78 ticks)

Nodes Cuts/

Node Left Objective IInf Best Integer Best Bound ItCnt Gap

- 0+ 0 69.0000 63.0000 1156 8.70%

0 0 64.0000 247 69.0000 64.0000 1156 7.25%

- 0+ 0 68.0000 64.0000 1472 5.88%

0 0 64.0000 249 68.0000 Cuts: 938 1472 5.88%

0 0 64.0000 34 68.0000 Cuts: 27 1568 5.88%

- 0+ 0 65.0000 64.0000 1568 1.54%

0 0 64.0000 84 65.0000 Cuts: 42 1754 1.54%

Repeating presolve.

Tried aggregator 4 times.

...

Root node processing (before b&c):

Real time = 1.36 sec. (382.25 ticks)

Parallel b&c, 8 threads:

Real time = 0.00 sec. (0.00 ticks)

Sync time (average) = 0.00 sec.

Wait time (average) = 0.00 sec.

Total (root+branch&cut) = 1.36 sec. (382.25 ticks)