{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:42:20Z","timestamp":1774798940259,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1023\/a:1008249414776","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"267-283","source":"Crossref","is-referenced-by-count":49,"title":["Global Optimization of Nonconvex Polynomial Programming Problems Having Rational Exponents"],"prefix":"10.1007","volume":"12","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"137724_CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F. A. and J. E. Falk (1983), Jointly constrained biconvex programming, Math. of Oper. Res.\n8, 273\u2013283.","journal-title":"Math. of Oper. Res."},{"key":"137724_CR2","doi-asserted-by":"crossref","unstructured":"Al-Khayyal, F. A., C. Larson and T. Van Voorhis (1994), A relaxation method for nonconvex quadratically constrained quadratic programs.","DOI":"10.1007\/BF01099462"},{"key":"137724_CR3","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1002\/1520-6750(199104)38:2<241::AID-NAV3220380209>3.0.CO;2-Z","volume":"38","author":"J. Brimberg","year":"1991","unstructured":"Brimberg, J. and R. F. Love (1991), Estimating travel distances by the weighted \u2113p norm, Naval Research Logistics\n38 241\u2013259.","journal-title":"Naval Research Logistics"},{"key":"137724_CR4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/BF00940767","volume":"47","author":"F. Cole","year":"1985","unstructured":"Cole, F., W. Gochet and Y. Smeers (1985), A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems, Journal of Optimization Theory and Applications\n47, 159\u2013180.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"137724_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/0377-2217(80)90070-3","volume":"5","author":"F. Cole","year":"1980","unstructured":"Cole, F., W. Gochet, F. Van Assche, J. Ecker and Y. Smeers (1980), Reversed geometric programming: A branch-and-bound method involving linear subproblems, European Journal of Operational Research\n5, 26\u201335.","journal-title":"European Journal of Operational Research"},{"key":"137724_CR6","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/BF01580667","volume":"10","author":"R. S. Dembo","year":"1976","unstructured":"Dembo, R. S. (1976), Aset of geometric programming test problems and their solutions, Mathematical Programming\n10, 192\u2013213.","journal-title":"Mathematical Programming"},{"key":"137724_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF00933402","volume":"26","author":"R. S. Dembo","year":"1978","unstructured":"Dembo, R. S. (1978), Current state of the art of algorithms and computer software for geometric programming, Journal of Optimization theory and Applications\n26, 149\u2013183.","journal-title":"Journal of Optimization theory and Applications"},{"key":"137724_CR8","volume-title":"Geometric Programming","author":"R. J. Duffin","year":"1967","unstructured":"Duffin, R. J., E. L. Peterson and C. Zener (1967), Geometric Programming. John Wiley & Sons, New York."},{"key":"137724_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"Acollection of test problems for constrained global optimization algorithms","author":"C. A. Floudas","year":"1990","unstructured":"Floudas, C. A. and P. M. Pardalos (1990), Acollection of test problems for constrained global optimization algorithms, Lecture Notes in Computer Science, Vol. 455, (eds. G Goos and J. Hartmanis). Springer Verlag, Berlin."},{"key":"137724_CR10","doi-asserted-by":"crossref","unstructured":"Floudas, C. A. and V. Visweswaran (1995), Quadratic optimization, in Handbook of Global Optimization, Nonconvex Optimization and its Applications (eds. R. Horst and P. M. Pardalos). Kluwer Academic Publishers, 217\u2013270.","DOI":"10.1007\/978-1-4615-2025-2_5"},{"key":"137724_CR11","doi-asserted-by":"crossref","first-page":"1397","DOI":"10.1016\/0098-1354(90)80020-C","volume":"14","author":"C. A. Floudas","year":"1990","unstructured":"Floudas, C. A. and V. Visweswaran (1990), A global optimization algorithm (GOP) for certain classes of nonconvex NLP's I: Theory, Computers and Chemical Engineering\n14, 1397\u20131417.","journal-title":"Computers and Chemical Engineering"},{"key":"137724_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, P., and B. Jaumard (1992), Reduction of indefinite quadratic programs to bilinear programs, {tiJournal of Global Optimization} 2(1), 41\u201360.","DOI":"10.1007\/BF00121301"},{"key":"137724_CR13","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF01096413","volume":"3","author":"P. Hansen","year":"1993","unstructured":"Hansen, P., B. Jaumard and J. Xiong (1993), Decomposition and interval arithmetic applied to global minimization of polynomial and rational functions, Journal of Global Optimization\n3, 421\u2013437.","journal-title":"Journal of Global Optimization"},{"key":"137724_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"1993","unstructured":"Horst, R. and H. Tuy (1993), Global Optimization: Deterministic Approaches, 2nd ed. Springer Verlag, Berlin.","edition":"2nd ed."},{"key":"137724_CR15","volume-title":"An infeasible interior-point algorithm for solving primal and dual geometric programs","author":"K. L. Kortanek","year":"1995","unstructured":"Kortanek, K. L., X. Xu and Y. Ye (1995), An infeasible interior-point algorithm for solving primal and dual geometric programs. Manuscript, Department of Management Science, The University of Iowa, Iowa City, IA 52242."},{"issue":"6\/7","key":"137724_CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/0898-1221(91)90168-4","volume":"21","author":"M. M. Kostreva","year":"1991","unstructured":"Kostreva, M. M. and L. A. Kinard (1991), A differentiable homotopy approach for solving polynomial optimization problems and noncooperative games, Computers Math. Applic.\n21(6\/7), 135\u2013143.","journal-title":"Computers Math. Applic."},{"key":"137724_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1111246.1111247","volume":"77","author":"L. S. Lasdon","year":"1979","unstructured":"Lasdon, L. S., A. D. Waren, S. Sarkar and F. Palacios, (1979), Solving the pooling problem using generalized reduced gradient and successive linear programming algorithms, SIGMAP Bull.\n77, 9\u201315.","journal-title":"SIGMAP Bull."},{"key":"137724_CR18","volume-title":"Global optimization in generalized geometric programming","author":"C. D. Maranas","year":"1994","unstructured":"Maranas, C. D. and C. A. Floudas (1994), Global optimization in generalized geometric programming. Working Paper, Department of Chemical Engineering, Princeton University, Princeton, NJ."},{"key":"137724_CR19","doi-asserted-by":"crossref","unstructured":"Passy, U. (1978), Global solutions of mathematical programs with intrinsically concave functions, {tiJournal of Optimization Theory and Applications} 26, 97\u2013115.","DOI":"10.1007\/BF00933273"},{"key":"137724_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1018001","volume":"18","author":"E. L. Peterson","year":"1976","unstructured":"Peterson, E. L. (1976), Geometric programming, SIAM Review\n18, 1\u201315.","journal-title":"SIAM Review"},{"key":"137724_CR21","doi-asserted-by":"crossref","unstructured":"Rickaert, M. J. and X. M. Martens (1978), Comparison of generalized geometric programming algorithms, {tiJournal of Optimization Theory and Applications} 26, 205\u2013242.","DOI":"10.1007\/BF00933404"},{"key":"137724_CR22","volume-title":"A finite algorithm for global minimization of separable concave programs","author":"H. P. Shectman","year":"1994","unstructured":"Shectman, H. P. and N. V. Sahindis (1994), A finite algorithm for global minimization of separable concave programs. Technical Report, Department of Mechanical and Industrial Engineering, University of Illinois, Urbana-Champagne, IL."},{"issue":"2&3","key":"137724_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1080\/01966324.1994.10737377","volume":"14","author":"H. D. Sherali","year":"1994","unstructured":"Sherali, H. D., A. Alameddine and T. S. Glickman (1994\/95), Biconvex models and algorithms for risk management problems, American Journal of Mathematical and Management Sciences\n14(2&3), 197\u2013228.","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"137724_CR24","series-title":"Research Report","volume-title":"Journal of Global Optimization","author":"H. D. Sherali","year":"1995","unstructured":"Sherali, H. D. and E. P. Smith (1995), A global optimization approach to a water distribution network design problem. Research Report #HDS95-6, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA (to appear in the Journal of Global Optimization)."},{"key":"137724_CR25","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H. D. Sherali","year":"1992","unstructured":"Sherali, H. D. and C. H. Tuncbilek (1992), A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique, Journal of Global Optimization\n2, 101\u2013112.","journal-title":"Journal of Global Optimization"},{"key":"137724_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H. D. Sherali","year":"1995","unstructured":"Sherali, H. D. and C. H. Tuncbilek (1995), A reformulation-convexification approach for solving nonconvex quadratic programming problems, Journal of Global Optimization\n7, 1\u201331.","journal-title":"Journal of Global Optimization"},{"key":"137724_CR27","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"H. D. Sherali","year":"1997","unstructured":"Sherali, H. D. and C. H. Tuncbilek (1997), Comparison of two Reformulation-Linearization Technique based linear programming relaxations for polynomial programming problems, Journal of Global Optimization\n10, 381\u2013390.","journal-title":"Journal of Global Optimization"},{"key":"137724_CR28","doi-asserted-by":"crossref","unstructured":"Sherali, H. D. and C. H. Tuncbilek (1996), New reformulation-linearization\/convexification relaxations for univariate and multivariate polynomial programming problems, under revision for Operations Research Letters.","DOI":"10.1016\/S0167-6377(97)00013-8"},{"key":"137724_CR29","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"N. Z. Shor","year":"1990","unstructured":"Shor, N. Z. (1990), Dual quadratic estimates in polynomial and boolean programming, Annals of Operations Research\n25, 163\u2013168.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"137724_CR30","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/29380.214343","volume":"13","author":"L. T. Watson","year":"1987","unstructured":"Watson, L. T., S. C. Billups and A. P. Morgan (1987), Algorithm 652 HOMPACK: A suite of codes for globally convergent homotopy algorithms, ACM Transactions on Mathematical Software\n13(3), 281\u2013310.","journal-title":"ACM Transactions on Mathematical Software"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008249414776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008249414776\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008249414776.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:40:42Z","timestamp":1751366442000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008249414776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["137724"],"URL":"https:\/\/doi.org\/10.1023\/a:1008249414776","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}