2

I have solved an integer programming problem using the price-and-branch (not branch-and-price) approach exactly as same as described in this question and obtained a feasible solution. As this approach is heuristic, I would like to evaluate the quality of my solution or examine how far it is from the global optimum solution. How can I do this?

Sina_Alef
  • 35
  • 3

1 Answers1

3

Assuming your problem is minimization, the step of solving the master LP yields a global lower bound, from which you can compute an optimality gap for your integer feasible solution.

RobPratt
  • 32,006
  • 1
  • 44
  • 84