{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:56:16Z","timestamp":1774252576458,"version":"3.50.1"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T00:00:00Z","timestamp":1774224000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12471287"],"award-info":[{"award-number":["12471287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11871196"],"award-info":[{"award-number":["11871196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010031","name":"Postdoctoral Research Foundation of China","doi-asserted-by":"publisher","award":["2017M622340"],"award-info":[{"award-number":["2017M622340"]}],"id":[{"id":"10.13039\/501100010031","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Key Scientific and Technological Research Project of Henan Province","award":["232102211085"],"award-info":[{"award-number":["232102211085"]}]},{"name":"Key Scientific and Technological Research Project of Henan Province","award":["12571319"],"award-info":[{"award-number":["12571319"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1007\/s10957-026-02959-7","type":"journal-article","created":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T06:33:18Z","timestamp":1774247598000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Spatial Algorithm for Mixed Integer Generalized Affine Multiplicative Problems"],"prefix":"10.1007","volume":"209","author":[{"given":"Hongwei","family":"Jiao","sequence":"first","affiliation":[]},{"given":"Haibing","family":"Ma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,3,23]]},"reference":[{"key":"2959_CR1","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.ress.2014.06.001","volume":"130","author":"MA Ardakan","year":"2014","unstructured":"Ardakan, M.A., Hamadani, A.Z.: Reliability optimization of series-parallel systems with mixed redundancy strategy in subsystems. Reliab. Eng. Syst. Safe. 130, 132\u2013139 (2014)","journal-title":"Reliab. Eng. Syst. Safe."},{"key":"2959_CR2","volume-title":"Linear-Fractional Programming: Theory, Methods","author":"EB Bajalinov","year":"2003","unstructured":"Bajalinov, E.B.: Linear-Fractional Programming: Theory, Methods. Applications and Software. Kluwer Academic Publishers, Dordrecht (2003)"},{"issue":"1","key":"2959_CR3","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10957-005-2655-4","volume":"126","author":"HP Benson","year":"2005","unstructured":"Benson, H.P.: Decomposition branch and bound based algorithm for linear programs with additional multiplicative constraints. J. Optim. Theory Appl. 126(1), 41\u201346 (2005)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2959_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1023\/A:1008316429329","volume":"15","author":"HP Benson","year":"1999","unstructured":"Benson, H.P.: An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming. J. Glob. Optim. 15(4), 315\u2013342 (1999)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"2959_CR5","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1016\/j.ejor.2006.08.036","volume":"182","author":"HP Benson","year":"2007","unstructured":"Benson, H.P.: A simplicial branch and bound duality-bounds algorithm for the linear sum-of-ratios problem. Eur. J. Oper. Res. 182(2), 597\u2013611 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2959_CR6","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1004657629105","volume":"104","author":"HP Benson","year":"2000","unstructured":"Benson, H.P., Boger, G.M.: Outcome-space cutting-plane algorithm for linear multiplicative programming. J. Optim. Theory Appl. 104(2), 301\u2013322 (2000)","journal-title":"J. Optim. Theory Appl."},{"issue":"9","key":"2959_CR7","doi-asserted-by":"publisher","first-page":"2573","DOI":"10.1016\/j.cor.2008.11.002","volume":"36","author":"Y Chen","year":"2009","unstructured":"Chen, Y., Jiao, H.: A nonisolated optimal solution of general linear multiplicative programming problems. Comput. Oper. Res. 36(9), 2573\u20132579 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"7","key":"2959_CR8","doi-asserted-by":"publisher","first-page":"2640","DOI":"10.1109\/TWC.2007.05960","volume":"6","author":"M Chiang","year":"2007","unstructured":"Chiang, M., Tan, C.W., Palomar, D.P., O\u2019neill, D., Julian, D.: Power control by geometric programming. IEEE T. Wirel. Commun. 6(7), 2640\u20132651 (2007)","journal-title":"IEEE T. Wirel. Commun."},{"key":"2959_CR9","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s10898-025-01519-z","volume":"93","author":"Y Deng","year":"2025","unstructured":"Deng, Y., Shen, P.: A new branch-and-bound algorithm for generalized affine multiplicative programming. J. Glob. Optim. 93, 87\u2013112 (2025)","journal-title":"J. Glob. Optim."},{"key":"2959_CR10","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-009-0309-2","volume":"128","author":"D Depetrini","year":"2011","unstructured":"Depetrini, D., Locatelli, M.: Approximation of linear fractional-multiplicative problems. Math. Program. 128, 437\u2013443 (2011)","journal-title":"Math. Program."},{"issue":"2","key":"2959_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1080\/03052159508941259","volume":"25","author":"MC Dorneich","year":"1995","unstructured":"Dorneich, M.C., Sahinidis, N.V.: Global optimization algorithms for chip design and compaction. Eng. Opt. 25(2), 131\u2013154 (1995)","journal-title":"Eng. Opt."},{"issue":"3","key":"2959_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/1022058","volume":"22","author":"JG Ecker","year":"1980","unstructured":"Ecker, J.G.: Geometric programming: methods, computations and applications. SIAM Rev. 22(3), 338\u2013362 (1980)","journal-title":"SIAM Rev."},{"key":"2959_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01096535","volume":"4","author":"JK Falk","year":"1994","unstructured":"Falk, J.K., Palocsay, S.W.: Image space analysis of generalized fractional programs. J. Glob. Optim. 4, 63\u201388 (1994)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2959_CR14","first-page":"117","volume":"164","author":"Y Gao","year":"2005","unstructured":"Gao, Y., Xu, C., Wang, Y., Zhang, L.: A new two-level linear relaxed bound method for geometric programming problems. Appl. Math. Comput. 164(1), 117\u2013131 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2959_CR15","first-page":"494","volume":"179","author":"Y Gao","year":"2006","unstructured":"Gao, Y., Xu, C., Yan, Y.: An outcome-space finite algorithm for solving linear multiplicative programming. Appl. Math. Comput. 179(2), 494\u2013505 (2006)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"2959_CR16","first-page":"143","volume":"32","author":"H Honno","year":"1989","unstructured":"Honno, H., Inori, M.: Bond portfolio optimization by bilinear fractional programming. J. Oper. Res. Soc. Japan. 32(2), 143\u2013158 (1989)","journal-title":"J. Oper. Res. Soc. Japan."},{"issue":"2","key":"2959_CR17","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s11075-022-01330-x","volume":"92","author":"Z Hou","year":"2023","unstructured":"Hou, Z., Liu, S.: Global algorithm for a class of multiplicative programs using piecewise linear approximation technique. Numer. Algorithms 92(2), 1063\u20131082 (2023)","journal-title":"Numer. Algorithms"},{"key":"2959_CR18","doi-asserted-by":"crossref","unstructured":"Huang, X., Gao, Y., Liu, X., Ma, X.: Convex relaxation technique-based output space branch-reduction-bound algorithm for minimizing generalized linear fractional multiplicative programs. Numer. Algorithms, 1\u201338 (2025)","DOI":"10.1007\/s11075-025-02211-9"},{"issue":"11","key":"2959_CR19","doi-asserted-by":"publisher","first-page":"4261","DOI":"10.1109\/TMAG.2005.856921","volume":"41","author":"RA Jabr","year":"2005","unstructured":"Jabr, R.A.: Application of geometric programming to transformer design. IEEE T. Magn. 41(11), 4261\u20134269 (2005)","journal-title":"IEEE T. Magn."},{"key":"2959_CR20","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s10898-023-01358-w","volume":"89","author":"H Jiao","year":"2024","unstructured":"Jiao, H., Li, B., Yang, W.: A criterion-space branch-reduction-bound algorithm for solving generalized multiplicative problems. J. Glob. Optim. 89, 597\u2013632 (2024)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"2959_CR21","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1016\/j.ejor.2015.01.039","volume":"243","author":"H Jiao","year":"2015","unstructured":"Jiao, H., Liu, S.: A practicable branch and bound algorithm for sum of linear ratios problem. Eur. J. Oper. Res. 243(3), 723\u2013730 (2015)","journal-title":"Eur. J. Oper. Res."},{"issue":"23\u201324","key":"2959_CR22","doi-asserted-by":"publisher","first-page":"7568","DOI":"10.1016\/j.apm.2015.03.025","volume":"39","author":"H Jiao","year":"2015","unstructured":"Jiao, H., Liu, S., Zhao, Y.: Effective algorithm for solving the generalized linear multiplicative problem with generalized polynomial constraints. Appl. Math. Model. 39(23\u201324), 7568\u20137582 (2015)","journal-title":"Appl. Math. Model."},{"key":"2959_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.chaos.2022.112701","volume":"164","author":"H Jiao","year":"2022","unstructured":"Jiao, H., Ma, J.: An efficient algorithm and complexity result for solving the sum of general affine ratios problem. Chaos Soliton. Fract. 164, 112701 (2022)","journal-title":"Chaos Soliton. Fract."},{"issue":"6","key":"2959_CR24","doi-asserted-by":"publisher","first-page":"4410","DOI":"10.3934\/jimo.2022135","volume":"19","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Ma, J., Shen, P., Qiu, Y.: Effective algorithm and computational complexity for solving sum of linear ratios problem. J. Ind. Manag. Optim. 19(6), 4410\u20134427 (2023)","journal-title":"J. Ind. Manag. Optim."},{"issue":"1","key":"2959_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/02331934.2023.2253816","volume":"74","author":"H Jiao","year":"2025","unstructured":"Jiao, H., Ma, J.: Optimizing generalized linear fractional program using the image space branch-reduction-bound scheme. Optimization 74(1), 1\u201332 (2025)","journal-title":"Optimization"},{"issue":"6","key":"2959_CR26","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1080\/02331934.2022.2032051","volume":"72","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Shang, Y., Chen, R.: A potential practical algorithm for minimizing the sum of affine fractional functions. Optimization 72(6), 1577\u20131607 (2023)","journal-title":"Optimization"},{"issue":"3","key":"2959_CR27","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/s40305-021-00375-4","volume":"11","author":"HW Jiao","year":"2023","unstructured":"Jiao, H.W., Shang, Y.L.: Two-level linear relaxation method for generalized linear fractional programming. J. Oper. Res. Soc. China 11(3), 569\u2013594 (2023)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"2959_CR28","first-page":"97","volume":"19","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shen, P.: Piecewise linear relaxation method for globally solving a class of multiplicative problems. Pac. J. Optim. 19(1), 97\u2013118 (2023)","journal-title":"Pac. J. Optim."},{"key":"2959_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2022.114784","volume":"419","author":"H Jiao","year":"2023","unstructured":"Jiao, H., Wang, W., Shang, Y.: Outer space branch-reduction-bound algorithm for solving generalized affine multiplicative problem. J. Comput. Appl. Math. 419, 114784 (2023)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2959_CR30","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"issue":"2","key":"2959_CR31","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1023\/A:1011250901810","volume":"20","author":"T Kuno","year":"2001","unstructured":"Kuno, T.: A finite branch and bound algorithm for linear multiplicative programming. Comput. Optim. Appl. 20(2), 119\u2013135 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"2959_CR32","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.cam.2015.11.009","volume":"296","author":"S Liu","year":"2016","unstructured":"Liu, S., Zhao, Y.: An efficient algorithm for globally solving generalized linear multiplicative programming. J. Comput. Appl. Math. 296, 840\u2013847 (2016)","journal-title":"J. Comput. Appl. Math."},{"key":"2959_CR33","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1023\/A:1008308913266","volume":"15","author":"X Liu","year":"1999","unstructured":"Liu, X., Umegaki, T., Yamamoto, Y.: Heuristic methods for linear multiplicative programming. J. Glob. Optim. 15, 433\u2013447 (1999)","journal-title":"J. Glob. Optim."},{"issue":"6","key":"2959_CR34","first-page":"5917","volume":"70","author":"S Ma","year":"2024","unstructured":"Ma, S., Gao, Y., Zhang, B.: Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs. Appl. Math. Comput. 70(6), 5917\u20135947 (2024)","journal-title":"Appl. Math. Comput."},{"key":"2959_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2020.105178","volume":"128","author":"V Mahmoodian","year":"2021","unstructured":"Mahmoodian, V., Charkhgard, H., Zhang, Y.: Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs. Comput. Oper. Res. 128, 105178 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"2959_CR36","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1287\/ijoc.2021.1097","volume":"34","author":"V Mahmoodian","year":"2022","unstructured":"Mahmoodian, V., Dayarian, I., Saghand, P.G.: A criterion space branch-and-cut algorithm for mixed integer bilinear maximum multiplicative programs. INFORMS J. Comput. 34(3), 1453\u20131470 (2022)","journal-title":"INFORMS J. Comput."},{"issue":"8\u20139","key":"2959_CR37","doi-asserted-by":"publisher","first-page":"1405","DOI":"10.1016\/S0165-1889(97)00032-8","volume":"21","author":"CD Maranas","year":"1997","unstructured":"Maranas, C.D., Androulakis, I.P., Floudas, C.A., Berger, A.J., Mulvey, J.M.: Solving long-term financial planning problems via global optimization. J. Econom. Dynam. Control. 21(8\u20139), 1405\u20131425 (1997)","journal-title":"J. Econom. Dynam. Control."},{"issue":"1","key":"2959_CR38","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1137\/19M1271762","volume":"31","author":"CJ Nohra","year":"2021","unstructured":"Nohra, C.J., Raghunathan, A.U., Sahinidis, N.: Spectral relaxations and branching strategies for global optimization of mixed-integer quadratic programs. SIAM. J. Optimiz. 31(1), 142\u2013171 (2021)","journal-title":"SIAM. J. Optimiz."},{"key":"2959_CR39","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1023\/A:1023274721632","volume":"26","author":"NTH Phuong","year":"2003","unstructured":"Phuong, N.T.H., Tuy, H.: A unified monotonic approach to generalized linear fractional programming. J. Glob. Optim. 26, 229\u2013259 (2003)","journal-title":"J. Glob. Optim."},{"issue":"4","key":"2959_CR40","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1023\/A:1024700901538","volume":"26","author":"HS Ryoo","year":"2003","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of multiplicative programs. J. Glob. Optim. 26(4), 387\u2013418 (2003)","journal-title":"J. Glob. Optim."},{"key":"2959_CR41","unstructured":"Saghand, P.G.: Maximum multiplicative programming: theory, algorithms, and applications. Graduate Theses and Dissertations (2021). https:\/\/digitalcommons.usf.edu\/etd\/9114"},{"issue":"3","key":"2959_CR42","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1111\/itor.12964","volume":"29","author":"PG Saghand","year":"2022","unstructured":"Saghand, P.G., Charkhgard, H.: A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach. Int. T. Oper. Res. 29(3), 1659\u20131687 (2022)","journal-title":"Int. T. Oper. Res."},{"key":"2959_CR43","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/j.cor.2018.08.004","volume":"101","author":"PG Saghand","year":"2019","unstructured":"Saghand, P.G., Charkhgard, H., Kwon, C.: A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach. Comput. Oper. Res. 101, 263\u2013274 (2019)","journal-title":"Comput. Oper. Res."},{"key":"2959_CR44","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0377-2217(83)90153-4","volume":"12","author":"S Schaible","year":"1983","unstructured":"Schaible, S., Ibaraki, T.: Factional programming. Eur. J. Oper. Res. 12, 325\u2013338 (1983)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2959_CR45","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/BF02192573","volume":"87","author":"S Schaible","year":"1995","unstructured":"Schaible, S., Sodini, C.: Finite algorithm for generalized multiplicative programming. J. Optim. Theory Appl. 87(2), 441\u2013455 (1995)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2959_CR46","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10898-013-0102-x","volume":"58","author":"L Shao","year":"2014","unstructured":"Shao, L., Ehrgott, M.: An objective space cut and bound algorithm for convex multiplicative programmes. J. Glob. Optim. 58(4), 711\u2013728 (2014)","journal-title":"J. Glob. Optim."},{"key":"2959_CR47","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-0035-6","volume-title":"Fractional Programming: Theory","author":"IM Stancu-Minasian","year":"1997","unstructured":"Stancu-Minasian, I.M.: Fractional Programming: Theory. Methods and Applications. Kluwer Academic Publishers, Dordrecht\/Boston\/London (1997)"},{"issue":"11","key":"2959_CR48","doi-asserted-by":"publisher","first-page":"2125","DOI":"10.1080\/02331934.2019.1632250","volume":"68","author":"IM Stancu-Minasian","year":"2019","unstructured":"Stancu-Minasian, I.M.: A ninth bibliography of fractional programming. Optimization 68(11), 2125\u20132169 (2019)","journal-title":"Optimization"},{"key":"2959_CR49","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1016\/j.cam.2018.10.038","volume":"350","author":"P Shen","year":"2019","unstructured":"Shen, P., Huang, B., Wang, L.: Range division and linearization algorithm for a class of linear ratios optimization problems. J. Comput. Appl. Math. 350, 324\u2013342 (2019)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2959_CR50","first-page":"353","volume":"162","author":"P Shen","year":"2005","unstructured":"Shen, P.: Linearization method of global optimization for generalized geometric programming. Appl. Math. Comput. 162(1), 353\u2013370 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"2959_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cam.2007.01.022","volume":"214","author":"PP Shen","year":"2008","unstructured":"Shen, P.P., Wang, C.F.: Global optimization for sum of generalized fractional functions. J. Comput. Appl. Math. 214(1), 1\u201312 (2008)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"2959_CR52","first-page":"99","volume":"150","author":"P Shen","year":"2004","unstructured":"Shen, P., Zhang, K.: Global optimization of signomial geometric programming using linear relaxation. Appl. Math. Comput. 150(1), 99\u2013114 (2004)","journal-title":"Appl. Math. Comput."},{"key":"2959_CR53","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2021.114080","volume":"407","author":"C Wang","year":"2022","unstructured":"Wang, C., Deng, Y., Shen, P.: A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems. J. Comput. Appl. Math. 407, 114080 (2022)","journal-title":"J. Comput. Appl. Math."},{"issue":"7","key":"2959_CR54","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1016\/j.cor.2010.10.016","volume":"38","author":"CF Wang","year":"2011","unstructured":"Wang, C.F., Liu, S.Y.: A new linearization method for generalized linear multiplicative programming. Comput. Oper. Res. 38(7), 1008\u20131013 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"2959_CR55","doi-asserted-by":"publisher","first-page":"2446","DOI":"10.1016\/j.apm.2011.09.002","volume":"36","author":"C Wang","year":"2012","unstructured":"Wang, C., Liu, S., Shen, P.: Global minimization of a generalized linear multiplicative programming. Appl. Math. Model. 36(6), 2446\u20132451 (2012)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"2959_CR56","first-page":"722","volume":"168","author":"Y Wang","year":"2005","unstructured":"Wang, Y., Liang, Z.: A deterministic global optimization algorithm for generalized geometric programming. Appl. Math. Comput. 168(1), 722\u2013737 (2005)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"2959_CR57","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.camwa.2012.08.017","volume":"168","author":"Y Wang","year":"2005","unstructured":"Wang, Y., Shen, P., Liang, Z.: A branch-and-bound algorithm to globally solve the sum of several linear ratios. Appl. Math. Comput. 168(1), 89\u2013101 (2005)","journal-title":"Appl. Math. Comput."},{"key":"2959_CR58","doi-asserted-by":"publisher","first-page":"997","DOI":"10.1007\/s10957-024-02461-y","volume":"202","author":"B Zhang","year":"2024","unstructured":"Zhang, B., Wang, H., Gao, Y.: Output-space outer approximation branch-and-bound algorithm for a class of linear multiplicative programs. J. Optim. Theory Appl. 202, 997\u20131026 (2024)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"2959_CR59","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1080\/00207160.2024.2407887","volume":"102","author":"Y Zhang","year":"2025","unstructured":"Zhang, Y., Shen, P.: An outcome space algorithm for solving general linear multiplicative programming. Int. J. Comput. Math. 102(2), 262\u2013279 (2025)","journal-title":"Int. J. Comput. Math."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02959-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-026-02959-7","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-026-02959-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T07:02:21Z","timestamp":1774249341000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-026-02959-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,23]]},"references-count":59,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["2959"],"URL":"https:\/\/doi.org\/10.1007\/s10957-026-02959-7","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,23]]},"assertion":[{"value":"29 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"16"}}