Bounding Global Minima with Interval Arithmetic

Louis J. Mancini, Garth P. McCormick · Operations Research · 1979

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.

Read the paper · More papers on PaperTik