On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems

Authors:
Faiz A. Al-Khayyal;Hanif D. Sherali
Affiliations:
-;-
Venue:
SIAM Journal on Optimization
Year:
1999

Citing 0
Cited 9

Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

Journal of Global Optimization
A branch and reduce approach for solving a class of low rank d.c. programs

Journal of Computational and Applied Mathematics
Outer approximation algorithms for canonical DC problems

Journal of Global Optimization
Feasibility-based bounds tightening via fixed points

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
A Cutting-Surface Method for Uncertain Linear Programs with Polyhedral Stochastic Dominance Constraints

SIAM Journal on Optimization
Approximate branch-and-bound global optimization using B-spline hypervolumes

Advances in Engineering Software
On interval-subgradient and no-good cuts

Operations Research Letters
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience

Operations Research Letters
Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global optimization algorithms are typically terminated with an $\epsilon$-approximate solution after a finite number of iterations. This paper shows how existing infinitely convergent branch-and-bound algorithms can be augmented to guarantee finite termination with an exact global solution for problems having extreme point solutions.