Jiao, Hongwei; Chen, Yongqiang A note on a deterministic global optimization algorithm. (English) Zbl 1154.65048 Appl. Math. Comput. 202, No. 1, 67-70 (2008). This note gives a short extension for a deterministic global optimization algorithm proposed by Y. Ji, K.-C. Zhang and S.-J. Qu [ibid. 185, No. 1, 382–387 (2007; Zbl 1114.65062)] for problems of the following form \[ \min f(x)= \sum^p_{j=1} h_j(x)= \sum^p_{j=1} {c_{j0}+ c^T_j x\over d_{j0}+ d^T_j x}\quad\text{s.t. }Ax\leq b,\;x\in\mathbb{R}^n. \] Reviewer: Hans Benker (Merseburg) Cited in 6 Documents MSC: 65K05 Numerical mathematical programming methods 90C32 Fractional programming 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut Keywords:global optimization; linear sum of ratios; branch and bound; linear relaxation; algorithm Citations:Zbl 1114.65062 PDFBibTeX XMLCite \textit{H. Jiao} and \textit{Y. Chen}, Appl. Math. Comput. 202, No. 1, 67--70 (2008; Zbl 1154.65048) Full Text: DOI References: [1] Ji, Y.; Zhang, K.-C.; Qu, S.-J., A deterministic global optimization algorithm, Applied Mathematics and Computation, 185, 382-387 (2007) · Zbl 1114.65062 This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.