| Article ID: | iaor2003734 |
| Country: | Germany |
| Volume: | 91 |
| Issue: | 1 |
| Start Page Number: | 117 |
| End Page Number: | 125 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Programming |
| Authors: | Dr M. |
| Keywords: | programming: integer |
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.