A potential practical algorithm for minimizing the sum of affine fractional functions

References

• Stancu-Minasian IM. Fractional programming: theory, methods and applications. Dordrecht: Kluwer Academic Publishers; 1997.
   Google Scholar
• Bajalinov EB. Linear-fractional programming: theory, methods, applications and software. Dordrecht: Kluwer Academic Publishers; 2003.
   Google Scholar
• Shen P, Zhu Z, Chen X. A practicable contraction approach for the sum of the generalized polynomial ratios problem. Eur J Oper Res. 2019;278(1):36–48.
   Web of Science ®Google Scholar
• Stancu-Minasian IM. A eighth bibliography of fractional programming. Optimization. 2017;66(3):439–470.
   Web of Science ®Google Scholar
• Sherali HD, Alameddine A. A new reformulation-linearization technique for bilinear programming problems. J Global Optim. 1992;2(4):379–410.
   Google Scholar
• Kuno T, Masaki T. A practical but rigorous approach to sum-of-ratios optimization in geometric applications. Comput Optim Appl. 2013;54:93–109.
   Web of Science ®Google Scholar
• Wang Y, Shen P, Liang Z. A branch-and-bound algorithm to globally solve the sum of several linear ratios. Appl Math Comput. 2005;168(1):89–101.
   Web of Science ®Google Scholar
• Stancu-Minasian IM. A sixth bibliography of fractional programming. Optimization. 2006;55(4):405–428.
   Web of Science ®Google Scholar
• Konno H, Yajima Y, Matsui T. Parametric simplex algorithms for solving a special class of nonconvex minimization problems. J Global Optim. 1991;1:65–81.
   Google Scholar
• Cambini A, Martein L, Schaible S. On maximizing a sum of ratios. J Inf Optim Sci. 1989;10:65–79.
   Google Scholar
• Konno H, Yamashita H. Minimizing sums and products of linear fractional functions over a polytope. Naval Res Logist. 1999;46:583–596.
   Web of Science ®Google Scholar
• Falk JE, Palocsay SW. Image space analysis of generalized fractional programs. J Global Optim. 1994;4:63–88.
   Web of Science ®Google Scholar
• Phuong NTH, Tuy H. A unified monotonic approach to generalized linear fractional programming. J Global Optim. 2003;26:229–259.
   Web of Science ®Google Scholar
• Quesada J, Grossmann I. A global optimization algorithm for linear fractional and bilinear programs. J Global Optim. 1995;6:39–76.
   Web of Science ®Google Scholar
• Konno H, Fukaishi K. A branch-and-bound algorithm for solving low-rank linear multiplicative and fractional programming problems. J Global Optim. 2000;18:283–299.
   Web of Science ®Google Scholar
• Kuno T. A revision of the trapezoidal branch-and-bound algorithm for linear sum-of-ratios problems. J Global Optim. 2005;33:215–234.
   Web of Science ®Google Scholar
• Shen PP, Li WM, Liang YC. Branch-reduction-bound algorithm for linear sum-of-ratios fractional programs. Pacific J Optim. 2015;11(1):79–99.
   Web of Science ®Google Scholar
• Benson HP. A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur J Oper Res. 2007;182:597–611.
   Web of Science ®Google Scholar
• Ji Y, Zhang K, Qu S. A deterministic global optimization algorithm. Appl Math Comput. 2007;185:382–387.
   Web of Science ®Google Scholar
• Jiao H, Wang Z, Chen Y. Global optimization algorithm for sum of generalized polynomial ratios problem. Appl Math Model. 2013;37:187–197.
   Web of Science ®Google Scholar
• Shen P, Huang B, Wang L. Range division and linearization algorithm for a class of linear ratios optimization problems. J Comput Appl Math. 2019;350:324–342.
   Web of Science ®Google Scholar
• Shen P-P, Lu T. Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J Inequalities Appl. 2018;2018:63. DOI:10.1186/s13660-018-1651-9
   PubMed Web of Science ®Google Scholar
• Shen P, Wang C. Linear decomposition approach for a class of nonconvex programming problems. J Inequalities Appl. 2017;2017:74. DOI:10.1186/s13660-017-1342-y
   PubMed Web of Science ®Google Scholar
• Shen P, Li W, Bai X. Maximizing for the sum of ratios of two convex functions over a convex set. Comput Oper Res. 2013;40(10):2301–2307.
   Web of Science ®Google Scholar
• Schaible S, Shi J. Fractional programming: the sum-of-ratios case. Optim Methods Softw. 2003;18:219–229.
   Web of Science ®Google Scholar
• Stancu-Minasian IM. A ninth bibliography of fractional programming. Optimization. 2019;68(11):2123–2167.
   Web of Science ®Google Scholar
• Jiao H, Liu S. A practicable branch and bound algorithm for sum of linear ratios problem. Eur J Oper Res. 2015;243:723–730.
   Web of Science ®Google Scholar
• Horst R, Tuy H. Global optimization: deterministic approaches. 2nd ed. Berlin: Spring Verlag; 1993.
   Google Scholar
• Depetrini D, Locatelli M. Approximation algorithm for linear fractional multiplicative problems. Math Program. 2011;128:437–443.
   Web of Science ®Google Scholar
• Wang CF, Shen PP. A global optimization algorithm for linear fractional programming. Appl Math Comput. 2008;204(1):281–287.
   Web of Science ®Google Scholar
• Gao Y, Jin S. A global optimization algorithm for sum of linear ratios problem. J Appl Math. 2013;2013:276–245. DOI:10.1155/2013/276245
   Web of Science ®Google Scholar
• Khajavirad A, Sahinidis NV. A hybrid LP/NLP paradigm for global optimization relaxations. Math Program Comput. 2018;10:383–421.
   Web of Science ®Google Scholar