Dual bounding procedures lead to convergent Branch–and–Bound algorithms
- 109 Downloads
Branch–and–Bound methods with dual bounding procedures have recently been used to solve several continuous global optimization problems. We improve results on their convergence theory and give a condition that enables us to detect infeasible partition sets from the dual optimal value.
Unable to display preview. Download preview PDF.