1. A method for using a computer system to solve a global optimization problem specified by a function &verbar; and a set of equality constraints, the method comprising: receiving a representation of the functions and the set of equality constraints q 1 (x)&equals;0 (i&equals;1,..., r) at the computer system, wherein &verbar; is a scalar function of a vector x&equals;(x 1, x 2, x 3,... x n ); storing the representation in a memory within the computer system; performing an interval global optimization process to compute guaranteed bounds on a globally minimum value of the function &verbar;(x) subject to the set of equality constraints; wherein performing the interval global optimization process involves, applying term consistency to the set of equality constraints over a subbox X, and excluding portions of the subbox X that can be shown to violate any of the equality constraints.