Kearfott, Ralph - In: Journal of Global Optimization 59 (2014) 2, pp. 459-476
In branch and bound algorithms in constrained global optimization, a sharp upper bound on the global optimum is … algorithms can simply evaluate the objective at such points to obtain approximate upper bounds. However, such points may actually … algorithms, objective values are accepted as upper bounds only if the point of evaluation is proven to be feasible. Such …