Relative Content

Tag Archive for linear-programmingcplexbranch-and-bound

How to access best LP node solution in branch and bound tree in CPLEX?

I am running a MIP for a finite time and it terminates with a non-zero gap. I want to access the solution (the decision variables and the objective) of the best LP relaxation (best lower bound for a minimization problem) so that I can think of ways to add/generate valid inequalities. Is there a way to get this information.