Abstract
In this paper, we study the problem of maximizing the sum of a concave–convex quadratic fractional function on a non-empty, bounded, convex quadratic feasible set, which is called the problem (QCQFP). By using a conventional semidefinite program (SDP) relaxation, QCQFP is reformulated as a class of linear fractional programming problems over the cone of positive semidefinite matrices, which we refer to these problems as SDFP. After expatiating the properties of SDFP, we transform SDFP into its equivalent problem (ESDFP) whose non-convexity is mainly reflected in the newly added nonlinear equality constraints. By relaxing these nonlinear equality constraints into linear constraints, a special SDP relaxation is generated for ESDFP. Based on these results, an effective branch-and-bound algorithm is designed, and its theoretical convergence and worst-case complexity are proved. Numerical experiments demonstrate that the proposed algorithm is effective and feasible.
Similar content being viewed by others
Data availability statement
Supporting data for this study are available from the corresponding author, as reasonably requested.
References
Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Publishing Corporation, New York (1988)
Benson, H.P.: On the global optimization of sums of linear fractional functions over a convex set. J. Optim. Theory Appl. 121, 19–39 (2004)
Bao, X., Sahinidis, N.V., Tawarmalani, M.: Semidefinite relaxations for quadratically constrained quadratic programming: a review and comparisons. Math. Program. 129, 129–157 (2011)
Benson, H.P.: Using concave envelopes to globally solve the nonlinear sum of ratios problem. J. Global Optim. 22, 343–364 (2002)
Benson, H.P.: On the construction of convex and concave envelope formulas for bilinear and fractional functions on quadrilaterals. Comput. Optim. Appl. 27, 5–22 (2004)
Calamai, P.H., Vicente, L.N., Júdice, J.J.: A new technique for generating quadratic programming test problems. Math. Program. 61, 215–231 (1993)
Carlsson, J.G., Shi, J.: A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. Ope. Res. Lett. 41, 381–389 (2013)
Charnes, A., Cooper, W.W.: Programming with linear fractional functionals. Nav. Res. Log. 9, 181–186 (2010)
Colantoni, C.S., Manes, R.P., Whinston, A.: Programming, profit rates and pricing decisions. Account. Rev. 44, 467–481 (1969)
Dinkelbach, W.: On nonlinear fractional programming. Manage. Sci. 13, 492–498 (1967)
Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. In: Floudas, C.A., Pardalos, P.M. (eds.) Recent Advances in Global Optimization, pp. 221–258. Princeton, Princeton University Press (1992)
Falk, J.E., Palocsay, S.W.: Image space analysis of generalized fractional programs. J. Global Optim. 4, 63–88 (1994)
Fang, S.-C., Gao, D.Y., Sheu, R.-L., Xing, W.X.: Global optimization for a class of fractional programming problems. J. Global Optim. 45, 337–353 (2009)
Freund, R.W., Jarre, F.: Solving the sum-of-ratios problem by an interior-point method. J. Global Optim. 19, 83–102 (2001)
Freund, A.M., Freund, P.A.V.: A branch-and-cut algorithm for a class of sum-of-ratios problems. Appl. Math. Comput. 268, 596–608 (2015)
Goedhart, M.H., Spronk, J.: Financial planning with fractional goals. Eur. J. Oper. Res. 82, 111–124 (1995)
Gao, L.B., Mishra, S.K., Shi, J.M.: An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem. Optim. Lett. 6, 221–230 (2012)
Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming. http://cvxr.com/cvx/download, v2.2 (2021)
Gleixner, A., Eifler, L., Gally, T., Gamrath, G., Gemander, P., Gottwald, R.L., Hendel, G., Hojny, C., Koch, T., Miltenberger, M., Müller, B., Pfetsch, M-E., Puchert, C., Rehfeldt, D., Schlösser, F., Serrano, F., Shinano, Y., Viernickel, J.M., Vigerske, S., Weninger, D., Witt, J-T., Witzig, J.: The SCIP Optimization Suite. https://www.scipopt.org/index.php/download, v5.0.1 (2017)
Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic Publishers, Netherlands (2000)
Jiao, H.W., Liu, S.Y.: A practicable branch and bound algorithm for sum of linear ratios problem. Eur. J. Oper. Res. 243, 723–730 (2015)
Jiao, H.W., Liu, S.Y., Yin, J.B., Zhao, Y.F.: Outcome space range reduction method for global optimization of sum of affine ratios problem. Open Math. 14, 736–746 (2016)
Jiao, H.W., Liu, S.Y.: Range division and compression algorithm for quadratically constrained sum of quadratic ratios. Comput. Appl. Math. 36, 225–247 (2015)
Jiao, H.W., Liu, S.Y.: An efficient algorithm for quadratic sum-of-ratios fractional programs problem. Numer. Func. Anal. Opt. 38, 1426–1445 (2017)
Konno, H., Watanabe, H.: Bond portfolio optimization problems and their applications to index tracking: a partial optimization approach. J. Oper. Res. Soc. Jpn. 39, 295–306 (2017)
Konno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Jpn. 32, 143–158 (2017)
Konno, H., Abe, N.: Minimization of the sum of three linear fractional functions. J. Global Optim. 15, 419–432 (1999)
Konno, H., Yamashita, H.: Minimizing sums and products of linear fractional functions over a polytope. Nav. Res. Log. 46, 583–596 (1999)
Liu, X., Gao, Y.L., Zhang, B., Tian, F.P.: A new global optimization algorithm for a class of linear fractional programming. Mathematics 7, article number: 867 (2019)
Lu, C., Deng, Z.B., Jin, Q.W.: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints. J. Global Optim. 67, 475–493 (2017)
Matsui, T.: NP-hardness of linear multiplicative programming and related problems. J. Global Optim. 9, 113–119 (1996)
Nesterov, Y.E., Nemirovskii, A.S.: An interior-point method for generalized linear-fractional programming. Math. Program. 69, 177–204 (1995)
Phuong, N., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Global Optim. 26, 229–259 (2003)
Stancu-Minasian, I.M.: A ninth bibliography of fractional programming. Optimization 68, 2125–2169 (2019)
Schaible, S.: Fractional programming. In: Horst, R., Pardalos, P.M. (eds.) Handbook of Global Optimization, pp. 495–608. Springer, Boston (1995)
Schaible, S., Ibaraki, T.: Fractional programming. Eur. J. Oper. Res. 12, 325–338 (1983)
Sawik, B.: Downside risk approach for multi-objective portfolio optimization. Oper. Res. Proc. 2011, 191–196 (2012)
Shen, P.P., Lu, T.: Regional division and reduction algorithm for minimizing the sum of linear fractional functions. J. Inequal. Appl. 2018, article number: 63 (2018)
Shen, P.P., Huang, B.D., Wang, L.F.: Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350, 324–342 (2019)
Shen, P.P., Chen, Y.Q., Ma, Y.: Solving sum of quadratic ratios fractional programs via monotonic function. Appl. Math. Comput. 212, 234–244 (2009)
Shen, P.P., Jin, L.: Using conical partition to globally maximizing the nonlinear sum of ratios. Appl. Math. Model. 34, 2396–2413 (2010)
Shen, P.P., Wang, K.M., Lu, T.: Outer space branch and bound algorithm for solving linear multiplicative programming problems. J. Global Optim. 78, 453–482 (2020)
Wang, Y.J., Zhang, K.C.: Global optimization of nonlinear sum of ratios Problem. Appl. Math. Comput. 158, 319–330 (2004)
Wang, L.F., Xia, Y.: A linear-time algorithm for globally maximizing the sum of a generalized rayleigh quotient and a quadratic form on the unit sphere. SIAM J. Optim. 29, 1844–1869 (2019)
Xu, C., Xu, X.M., Wang, H.F.: The fractional minimal cost flow problem on network. Optim. Lett. 5, 307–317 (2011)
Xia, Y., Wang, L.F., Wang, S.: Minimizing the sum of linear fractional functions over the cone of positive semidefinite matrices: approximation and applications. Ope. Res. Lett. 46, 76–80 (2018)
Zhang, L.H.: On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere. Comput. Optim. Appl. 54, 111–139 (2013)
Zhang, L.H.: On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients. J. Comput. Appl. Math. 257, 14–28 (2014)
Zhang, B., Gao, Y.L., Liu, X., Huang, X.L.: Output-space branch-and-bound reduction algorithm for a class of linear multiplicative programs. Mathematics 8, article number: 315 (2020)
Acknowledgements
We thank each anonymous reviewer for their valuable comments and suggestions, which will help improve the quality of the papers.
Funding
This research is supported by the National Natural Science Foundation of China [Grant No. 11961001], the Construction Project of first-class subjects in Ningxia higher Education [Grant No. NXYLXK2017B09] and the Major proprietary funded project of North Minzu University [Grant No. ZDZX201901].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Miguel F. Anjos.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Zhang, B., Gao, Y., Liu, X. et al. An Outcome-Space-Based Branch-and-Bound Algorithm for a Class of Sum-of-Fractions Problems. J Optim Theory Appl 192, 830–855 (2022). https://doi.org/10.1007/s10957-021-01992-y
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10957-021-01992-y