dc.contributor.author |
Adm, Mohammad |
|
dc.contributor.author |
Titi, Jihad |
|
dc.contributor.author |
Elgayar, Ali |
|
dc.contributor.author |
Garloff, Jürgen |
|
dc.date.accessioned |
2023-05-30T07:26:23Z |
|
dc.date.available |
2023-05-30T07:26:23Z |
|
dc.date.issued |
2023 |
|
dc.identifier.uri |
http://localhost:8080/xmlui/handle/123456789/8880 |
|
dc.description.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. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
in M. Ceberio and V. Kreinovich (eds.), Decision Making under Uncertainty and Constraints, Studies in Systems, Decision and Control 217, Springer Nature |
en_US |
dc.subject |
Multivariate rational function |
en_US |
dc.subject |
Range enclosure |
en_US |
dc.subject |
Bernstein polynomial |
en_US |
dc.title |
Bounding the Range of a Sum of Multivariate Rational Functions |
en_US |
dc.type |
Book chapter |
en_US |