4 ms·
Every time an integer feasible point is found during the iterative process these algorithms use (branch and bound), you get a new upper bound on the global mini
by math_dandy 3y ago
Every time an integer feasible point is found during the iterative process these algorithms use (branch and bound), you get a new upper bound on the global minimum. It’s not clear to me how these dynamically generated upper bounds highly specific to the particular problem relate to the upper bounds of a more general nature that R&R produce.
- nkh 3y ago> upper bounds of a more general nature that R&R produce If it's an upper bound, it should be pretty easy to plug into the existing stuff under the hood in these solvers. Can you provide my insight into how the R&R "Upper bound" is different and "more general in nature"?