Originally posted by: dbaena
Hi,
I am solving a minimization mixed integer programming problem with branch and cut of CPLEX.
I have a IloMIPIncumbentCallback and at each new incumbent found I show the value and the time cplex found it. I would like to show also the lower bound and the of this solution. How can i do it in cplex c++?
Thanks a lot.
#CPLEXOptimizers#DecisionOptimization