{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T00:54:32Z","timestamp":1773708872476,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T00:00:00Z","timestamp":1339545600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10898-012-9933-0","type":"journal-article","created":{"date-parts":[[2012,6,19]],"date-time":"2012-06-19T17:25:02Z","timestamp":1340126702000},"page":"1123-1142","source":"Crossref","is-referenced-by-count":22,"title":["Branch-reduction-bound algorithm for generalized geometric programming"],"prefix":"10.1007","volume":"56","author":[{"given":"Peiping","family":"Shen","sequence":"first","affiliation":[]},{"given":"Xiaoai","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,6,13]]},"reference":[{"issue":"1","key":"9933_CR1","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00121301","volume":"2","author":"P. Hansen","year":"1992","unstructured":"Hansen P., Jaumard B.: Reduction of indefinite quadratic programs to bilinear programs. J. Global Optim. 2(1), 41\u201360 (1992)","journal-title":"J. Global Optim."},{"key":"9933_CR2","volume-title":"Applied Geometric Programming","author":"C.S. Beightler","year":"1976","unstructured":"Beightler C.S., Phillips D.T.: Applied Geometric Programming. Wiley, New York, NY (1976)"},{"issue":"3","key":"9933_CR3","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01535411","volume":"5","author":"M. Avriel","year":"1971","unstructured":"Avriel M., Williams A.C.: An extension of geometric programming with applications in engineering optimization. J. Eng. Math. 5(3), 187\u2013199 (1971)","journal-title":"J. Eng. Math."},{"key":"9933_CR4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF00933274","volume":"26","author":"T.R. Jefferson","year":"1978","unstructured":"Jefferson T.R., Scott C.H.: Generalized geometric programming applied to problems of optimal control: I.theory. J. Optim. Theory Appl. 26, 117\u2013129 (1978)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20134","key":"9933_CR5","first-page":"631","volume":"29","author":"K.J. Nand","year":"1995","unstructured":"Nand K.J.: Geometric programming based robot control design. Comput. Ind. Eng. 29(1\u20134), 631\u2013635 (1995)","journal-title":"Comput. Ind. Eng."},{"issue":"8","key":"9933_CR6","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1080\/095372800750038382","volume":"11","author":"K. Das","year":"2000","unstructured":"Das K., Roy T.K., Maiti M.: Multi-item inventory model with under imprecise objective and restrictions: a geometric programming approach. Prod. Plan. Control 11(8), 781\u2013788 (2000)","journal-title":"Prod. Plan. Control"},{"issue":"10","key":"9933_CR7","doi-asserted-by":"crossref","first-page":"957","DOI":"10.1016\/0305-0548(96)00008-1","volume":"23","author":"C. Jae Chul","year":"1996","unstructured":"Jae Chul C., Bricker Dennis L.: Effectiveness of a geometric programming algorithm for optimization of machining economics models. Comput. Oper. Res. 23(10), 957\u2013961 (1996)","journal-title":"Comput. Oper. Res."},{"key":"9933_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-7152(94)90219-4","volume":"21","author":"H. EI Barmi","year":"1994","unstructured":"EI Barmi H., Dykstra R.L.: Restricted multinomial maximum likelihood estimation based upon Fenchel duality. Stat. Probab. Lett. 21, 121\u2013130 (1994)","journal-title":"Stat. Probab. Lett."},{"key":"9933_CR9","unstructured":"Bricker, D.L., Kortanek, K.O., Xu, L.: Maximum linklihood estimates with order restrictions on probabilities and odds ratios: a geometric programming approach. Applied Mathematical and Computational Sciences, University of IA, Iowa City, IA (1995)"},{"key":"9933_CR10","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0167-6377(90)90048-A","volume":"9","author":"R. Jagannathan","year":"1990","unstructured":"Jagannathan R.: A stochastic geometric programming problem with multiplicative recourse. Oper. Res. Lett. 9, 99\u2013104 (1990)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"9933_CR11","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0098-1354(96)00282-7","volume":"21","author":"C.D. Maranas","year":"1997","unstructured":"Maranas C.D., Floudas C.A.: Global optimization in generalized geometric programming. Comput. Chem. Eng. 21(4), 351\u2013369 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"9933_CR12","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1002\/aic.690200416","volume":"20","author":"M.J. Rijckaert","year":"1974","unstructured":"Rijckaert M.J., Matens X.M.: Analysis and optimization of the Williams-Otto process by geometric programming. AICHE J. 20(4), 742\u2013750 (1974)","journal-title":"AICHE J."},{"issue":"3","key":"9933_CR13","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/1022058","volume":"22","author":"J.G. 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":"9933_CR14","first-page":"155","volume":"76","author":"K.O. Kortanek","year":"1996","unstructured":"Kortanek K.O., Xiaojie X., Yinyu Y.: An infeasible interior-point algorithm for solving primal and dual geometric programs. Math. Program. 76, 155\u2013181 (1996)","journal-title":"Math. Program."},{"key":"9933_CR15","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/0120075","volume":"20","author":"U. Passy","year":"1971","unstructured":"Passy U.: Generalized weighted mean programming. SIAM J. Appl. Math. 20, 763\u2013778 (1971)","journal-title":"SIAM J. Appl. Math."},{"issue":"5","key":"9933_CR16","first-page":"1344","volume":"15","author":"U. Passy","year":"1967","unstructured":"Passy U., Wilde D.J.: Generalized polynomial optimization. J. Appl. Math. 15(5), 1344\u20131356 (1967)","journal-title":"J. Appl. Math."},{"key":"9933_CR17","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1016\/j.camwa.2004.07.008","volume":"48","author":"Y. Wang","year":"2004","unstructured":"Wang Y., Zhang K., Gao Y.: Global optimization of generalized geometric programming. Appl. Math. Comput. 48, 1505\u20131516 (2004)","journal-title":"Appl. Math. Comput."},{"key":"9933_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.ejor.2007.06.034","volume":"190","author":"S. Qu","year":"2008","unstructured":"Qu S., Zhang K., Wang F.: A global optimization using linear relaxation for generalized geometric programming. Eur. J. Oper. Res. 190, 345\u2013356 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9933_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/S0096-3003(03)00200-5","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, 99\u2013114 (2004)","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"9933_CR20","doi-asserted-by":"crossref","first-page":"886","DOI":"10.1016\/j.amc.2006.05.208","volume":"182","author":"S. Qu","year":"2007","unstructured":"Qu S., Zhang K., Ji Y.: A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation. Appl. Math. Comput. 182(2), 886\u2013894 (2007)","journal-title":"Appl. Math. Comput."},{"key":"9933_CR21","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1016\/j.amc.2005.01.142","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, 722\u2013737 (2005)","journal-title":"Appl. Math. Comput."},{"key":"9933_CR22","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1016\/j.amc.2006.05.137","volume":"183","author":"P. Shen","year":"2006","unstructured":"Shen P., Jiao H.: A new rectangle branch-and-pruning approach for generalized geometric programming. Appl. Math. Comput. 183, 1027\u20131038 (2006)","journal-title":"Appl. Math. Comput."},{"key":"9933_CR23","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Tuncbilek C.H.: A global optimization algorithm for polynomial programming problems using a formulation-linearzation technique. J. Glob. Optim. 2, 101\u2013112 (1992)","journal-title":"J. Glob. Optim."},{"key":"9933_CR24","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1008249414776","volume":"12","author":"H.D. Sherali","year":"1998","unstructured":"Sherali H.D.: Global optimization of nonconvex polynomial programming problems having rational exponents. J. Glob. Optim. 12, 267\u2013283 (1998)","journal-title":"J. Glob. Optim."},{"key":"9933_CR25","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10957-008-9402-6","volume":"138","author":"C.E. Gounaris","year":"2008","unstructured":"Gounaris C.E., Floudas C.A.: Convexity of products of univariate functions and convexification transformations for geometric programming. J. Optim. Theory Appl. 138, 407\u2013427 (2008)","journal-title":"J. Optim. Theory Appl."},{"key":"9933_CR26","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10898-009-9414-2","volume":"46","author":"H.C. Lu","year":"2010","unstructured":"Lu H.C., Floudas C.A.: Convex relaxation for solving posynomial programs. J. Glob. Optim. 46, 147\u2013154 (2010)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9933_CR27","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/ijoc.1100.0403","volume":"23","author":"J.F. Tsai","year":"2011","unstructured":"Tsai J.F., Lin M.H.: An efficient global approach for posynomial geometric programming problems. INFORMS J. Comput. 23(3), 483\u2013492 (2011)","journal-title":"INFORMS J. Comput."},{"key":"9933_CR28","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10589-007-9148-3","volume":"44","author":"Y. Wang","year":"2009","unstructured":"Wang Y., Li T., Liang Z.: A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty. Comput. Optim. Appl. 44, 139\u2013158 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"9933_CR29","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/s10898-008-9283-0","volume":"41","author":"P. Shen","year":"2008","unstructured":"Shen P., Ma Y., Chen Y.Y.: A robust algorithm for generalized geometric programming. J. Glob. Optim. 41, 593\u2013612 (2008)","journal-title":"J. Glob. Optim."},{"key":"9933_CR30","first-page":"357","volume":"1","author":"H. Tuy","year":"2005","unstructured":"Tuy H.: Polynomial optimization: a robust approach. Pac. J. Optim. 1, 357\u2013374 (2005)","journal-title":"Pac. J. Optim."},{"key":"9933_CR31","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/j.disopt.2007.11.005","volume":"5","author":"R. Porn","year":"2008","unstructured":"Porn R., Bjork K.M., Westerlund T.: Global solution of optimization of problems with signomial parts. Discrete Optim. 5, 108\u2013120 (2008)","journal-title":"Discrete Optim."},{"key":"9933_CR32","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1080\/10556780802702278","volume":"24","author":"A. Lundell","year":"2009","unstructured":"Lundell A., Westerlund T.: Convex underestimation strategies for signomial functions. Optim. Methods Softw. 24, 505\u2013522 (2009)","journal-title":"Optim. Methods Softw."},{"key":"9933_CR33","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10898-007-9223-4","volume":"43","author":"A. Lundell","year":"2009","unstructured":"Lundell A., Westerlund J., Westerlund T.: Some transformation techniques with applications in global optimization. J. Glob. Optim. 43, 391\u2013405 (2009)","journal-title":"J. Glob. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9933-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-012-9933-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-012-9933-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:59:02Z","timestamp":1559278742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-012-9933-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6,13]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9933"],"URL":"https:\/\/doi.org\/10.1007\/s10898-012-9933-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,6,13]]}}}