Dear friends,

I recently submitted a paper about the operating room planning problem. This paper proposed a mixed integer linear programming model. I implemented this model in GAMS and set the Cplex as its main solver. Since the Cplex could not solve large-scale instances to optimality in short computing time, I proposed a heuristic algorithm.

Now, the journal sent this paper back and asked me to make a revision. One of the reviewers asked me:

"For the instances that are not solved to optimality the comparison with the dual bound should be given."

Could you please tell me how I can do so? Does the Best Bound refer to the value of dual bound?

Very Respectfully Yours,

Amirhossein