Bounding Global Minima with Interval Arithmetic

Abstract

We show how techniques of interval arithmetic can be used to give bounds on the global minima of unconstrained optimization problems. We illustrate the techniques using the design of a hypothetical chemical plant.