Optimization of chemical processes often leads to nonlinear programming problems that are nonconvex. Such problems may possess many local optima, whose objective function values vary significantly from one to another. Thus identifying the global optimum is an important, albeit difficult, endeavor. A deterministic algorithm based on interval analysis branch and bound is proposed in this paper to be suitable for global optimization of chemical processes.