Bounding the Range of a Sum of Multivariate Rational Functions

Abstract

Bounding the range of a sum of rational functions is an important task if, e.g., the global polynomial sum of ratios problem is solved by a branch and bound algorithm. In this paper, bounding methods are discussed which rely on the expansion of a multivariate polynomial into Bernstein polynomials.