This interval is determined using linear programming techniques. Finally, bounding convex envelope approximating problems are constructed and solved globally over any remaining intervals. Intervals ...

The essential features of the branch-and-bound approach to constrained optimization are described, and several specific applications are reviewed. These include integer linear programming (Land-Doig ...