Result: A branch-and-bound algorithm to globally solve the sum of several linear ratios: A branch and bound algorithm to globally solve the sum of several linear ratios

Title:
A branch-and-bound algorithm to globally solve the sum of several linear ratios: A branch and bound algorithm to globally solve the sum of several linear ratios
Authors:
Wang Yan-jun, Shen Pei-ping, Liang Zhi-an
Source:
Applied Mathematics and Computation. 168:89-101
Publisher Information:
Elsevier BV, 2005.
Publication Year:
2005
Subject Terms:
algorithm, Numerical mathematical programming methods, fractional programming, branch and bound, global optimization, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, 02 engineering and technology, numerical results, 0101 mathematics, Fractional programming, 01 natural sciences
Document Type:
Academic journal Article
File Description:
application/xml
Language:
English
ISSN:
0096-3003
DOI:
10.1016/j.amc.2004.08.016
Access URL:
https://zbmath.org/2223214
https://doi.org/10.1016/j.amc.2004.08.016
https://dblp.uni-trier.de/db/journals/amc/amc168.html#YanjunPZ05
https://www.sciencedirect.com/science/article/pii/S0096300304005880
Rights:
Elsevier TDM
Accession Number:
edsair.doi.dedup.....fb7c3b15aaa15cec6fb26e55aee0c06b
Database:
OpenAIRE

Further Information

The authors develop a branch and bound globally convergent algorithm for optimizing the sum of several linear fractional functions over a polytope by solving a series of linear programming problems. Some numerical results are presented.