{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:14:58Z","timestamp":1759666498341},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"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":[[2009,10]]},"DOI":"10.1007\/s10898-008-9371-1","type":"journal-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T05:22:58Z","timestamp":1225948978000},"page":"237-257","source":"Crossref","is-referenced-by-count":20,"title":["A new Lagrangean approach to the pooling problem"],"prefix":"10.1007","volume":"45","author":[{"given":"Hossa","family":"Almutairi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Elhedhli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"9371_CR1","doi-asserted-by":"crossref","first-page":"1956","DOI":"10.1021\/ie980666q","volume":"38","author":"N. Adhya","year":"1999","unstructured":"Adhya N., Tawarmalani M., Sahinidis N.: A Lagrangian approach to the pooling problem. Ind. Eng. Chem. Res. 38, 1956\u20131972 (1999)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"2","key":"9371_CR2","first-page":"124","volume":"8","author":"F.A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal F.A., Falk J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8(2), 124\u2013131 (1983)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"9371_CR3","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1287\/mnsc.1030.0207","volume":"50","author":"C. Audet","year":"2004","unstructured":"Audet C., Brimberg J., Hansen P., Le Digabel S., Maldenovic N.: Pooling problem: alternate formulations and solution methods. Manage. Sci. 50(6), 761\u2013776 (2004)","journal-title":"Manage. Sci."},{"key":"9371_CR4","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1287\/mnsc.31.3.264","volume":"31","author":"T.E. Baker","year":"1985","unstructured":"Baker T.E., Lasdon L.S.: Successive linear programming at Exxon. Manage. Sci. 31, 264\u2013274 (1985)","journal-title":"Manage. Sci."},{"key":"9371_CR5","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01582066","volume":"63","author":"A. Ben-Tal","year":"1994","unstructured":"Ben-Tal A., Eiger G., Greshovitz V.: Global minimization by reducing the duality gap. Math. Program. 63, 193\u2013212 (1994)","journal-title":"Math. Program."},{"key":"9371_CR6","volume-title":"Nonlinear Programs for Product Blending","author":"C.E. Bodington","year":"1979","unstructured":"Bodington C.E., Randall W.C.: Nonlinear Programs for Product Blending. Joint National TIMS\/ORSA Meeting, New Orleans (1979)"},{"key":"9371_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher M.L.: The Lagrangian relaxation method for solving integer programming problems. Manage. Sci. 27, 1\u201318 (1981)","journal-title":"Manage. Sci."},{"issue":"3","key":"9371_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/ijoc.2.3.225","volume":"2","author":"C.A. Floudas","year":"1990","unstructured":"Floudas C.A., Aggarwal A.: A Decomposition strategy for the optimum search in the pooling problem. ORSA J. Comput. 2(3), 225\u2013235 (1990)","journal-title":"ORSA J. Comput."},{"key":"9371_CR9","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/02331939208843786","volume":"24","author":"L.R. Foulds","year":"1992","unstructured":"Foulds L.R., Haugland D., Jonsten K.: A bilinear approach to the pooling problem. Optimization 24, 165\u2013180 (1992)","journal-title":"Optimization"},{"key":"9371_CR10","unstructured":"GLPK (GNU Linear Programming Kit). http:\/\/www.gnu.org\/software\/glpk\/glpk.htmt"},{"key":"9371_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/mnsc.7.4.379","volume":"7","author":"R.E. Griffith","year":"1961","unstructured":"Griffith R.E., Stewart R.A.: A nonlinear programming technique for the optimization of continuous processing system. Manage. Sci. 7, 379\u2013392 (1961)","journal-title":"Manage. Sci."},{"key":"9371_CR12","first-page":"29","volume":"25","author":"C.A. Haverly","year":"1978","unstructured":"Haverly C.A.: Studies of the behavior of recursion for the pooling problem. ACM SIGMAP Bull. 25, 29\u201332 (1978)","journal-title":"ACM SIGMAP Bull."},{"key":"9371_CR13","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1145\/1111243.1111244","volume":"26","author":"C.A. Haverly","year":"1979","unstructured":"Haverly C.A.: Behavior of recursion model\u2013more studies. ACM SIGMAP Bull. 26, 22\u201328 (1979)","journal-title":"ACM SIGMAP Bull."},{"key":"9371_CR14","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1111246.1111247","volume":"27","author":"L.S. Lasdon","year":"1979","unstructured":"Lasdon L.S., Waren A.D., Sarkar S., Palacios-Gomez F.: Solving the pooling problem using generalized reduced gradient and successive linear programming algorithm. ACM SIGMAP Bull. 27, 9\u201315 (1979)","journal-title":"ACM SIGMAP Bull."},{"key":"9371_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L. Liberti","year":"2006","unstructured":"Liberti L., Pantelides C.C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J . Glob. Optim. 36, 161\u2013189 (2006)","journal-title":"J . Glob. Optim."},{"key":"9371_CR16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P.: Computability of global solutions to factorable nonconvex programs. Part I-convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"3","key":"9371_CR17","doi-asserted-by":"crossref","first-page":"1027","DOI":"10.1002\/aic.10717","volume":"52","author":"C. Meyer","year":"2006","unstructured":"Meyer C., Floudas C.: Global optimization of a combinatorially complex generalized pooling problem. AIChE J. 52(3), 1027\u20131037 (2006)","journal-title":"AIChE J."},{"issue":"12","key":"9371_CR18","doi-asserted-by":"crossref","first-page":"1219","DOI":"10.1016\/0098-1354(94)00123-5","volume":"19","author":"I. Quesada","year":"1995","unstructured":"Quesada I., Grossmann I.E.: Global optimization of bilinear process networks and multicomponent flows. Comput. Chem. Eng. 19(12), 1219\u20131242 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"9371_CR19","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Alameddine A.: A new reformulation-linearization technique for bilinear programming problems. J . Glob. Optim. 2, 379\u2013410 (1992)","journal-title":"J . Glob. Optim."},{"issue":"5","key":"9371_CR20","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1016\/0098-1354(83)80006-4","volume":"7","author":"J.D. Simon","year":"1983","unstructured":"Simon J.D., Azma H.M.: Exxon experience with large scale linear and nonlinear programming applications. Comput. Chem. Eng. 7(5), 605\u2013614 (1983)","journal-title":"Comput. Chem. Eng."},{"key":"9371_CR21","doi-asserted-by":"crossref","unstructured":"Tawarmalani, M., Sahinidis, N.: Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications (Kluwer Book Series in Nonconvex Optimization and its Applications, vol. 65). Kluwer Academic, Dordrecht (2002)","DOI":"10.1007\/978-1-4757-3532-1"},{"key":"9371_CR22","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/0098-1354(90)80021-3","volume":"14","author":"V. Visweswaran","year":"1990","unstructured":"Visweswaran V., Floudas C.A.: A global optimization algorithm (GOP) for certain classes of nonconvex NLPs: application of theory and test problems. Comp. Chem. Eng. 14, 1419\u20131434 (1990)","journal-title":"Comp. Chem. Eng."},{"issue":"3","key":"9371_CR23","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF01096414","volume":"3","author":"V. Visweswaran","year":"1993","unstructured":"Visweswaran V., Floudas C.A.: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints. J . Glob. Optim. 3(3), 439\u2013462 (1993)","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-008-9371-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-008-9371-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-008-9371-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:12Z","timestamp":1559304732000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-008-9371-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,7]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,10]]}},"alternative-id":["9371"],"URL":"https:\/\/doi.org\/10.1007\/s10898-008-9371-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,7]]}}}