caa a22 4500 463169395 CHVBK 20180406164809.0 cr unu---uuuuu 170326e20071001xx s 000 0 eng 10.1007/s10957-007-9199-8 doi (NATIONALLICENCE)springer-10.1007/s10957-007-9199-8 Benson H. Warrington College of Business Administration, University of Florida, Gainesville, FL, USA aut Solving Sum of Ratios Fractional Programs via Concave Minimization [Elektronische Daten] [H. Benson] This article presents an algorithm for globally solving a sum of ratios fractional programming problem. To solve this problem, the algorithm globally solves an equivalent concave minimization problem via a branch-and-bound search. The main work of the algorithm involves solving a sequence of convex programming problems that differ only in their objective function coefficients. Therefore, to solve efficiently these convex programming problems, an optimal solution to one problem can potentially be used to good advantage as a starting solution to the next problem. Springer Science+Business Media, LLC, 2007 Global optimization nationallicence Sum of ratios nationallicence Fractional programming nationallicence Concave minimization nationallicence Branch-and-bound algorithms nationallicence Journal of Optimization Theory and Applications Springer US; http://www.springer-ny.com 135/1(2007-10-01), 1-17 0022-3239 135:1<1 2007 135 10957 https://doi.org/10.1007/s10957-007-9199-8 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s10957-007-9199-8 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Benson H. Warrington College of Business Administration, University of Florida, Gainesville, FL, USA aut NATIONALLICENCE 773 0- Journal of Optimization Theory and Applications Springer US; http://www.springer-ny.com 135/1(2007-10-01), 1-17 0022-3239 135:1<1 2007 135 10957 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer