{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T18:25:28Z","timestamp":1775931928381,"version":"3.50.1"},"reference-count":50,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:00:00Z","timestamp":1526256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Prog. Comp."],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1007\/s12532-018-0138-5","type":"journal-article","created":{"date-parts":[[2018,5,14]],"date-time":"2018-05-14T00:09:53Z","timestamp":1526256593000},"page":"383-421","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":111,"title":["A hybrid LP\/NLP paradigm for global optimization relaxations"],"prefix":"10.1007","volume":"10","author":[{"given":"Aida","family":"Khajavirad","sequence":"first","affiliation":[]},{"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,14]]},"reference":[{"key":"138_CR1","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s10107-011-0499-2","volume":"137","author":"AA Ahmadi","year":"2013","unstructured":"Ahmadi, A.A., Olshevsky, A., Parrilo, P.A., Tsitsiklis, J.N.: NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137, 453\u2013476 (2013)","journal-title":"Math. Program."},{"key":"138_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-7600-2","volume-title":"Generalized Concavity","author":"M Avriel","year":"1988","unstructured":"Avriel, M., Diewert, W.E., Schaible, S., Zang, I.: Generalized Concavity. Plenum Press, New York (1988)"},{"key":"138_CR3","unstructured":"Bao, X.: Automatic convexity detection for global optimization. Master\u2019s thesis, Department of Chemical Engineering, University of Illinois at Urbana-Champaign (2007)"},{"issue":"1","key":"138_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., Tawarmalani, M.: Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7(1), 1\u201337 (2015)","journal-title":"Math. Program. Comput."},{"key":"138_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BF01580653","volume":"10","author":"EML Beale","year":"1976","unstructured":"Beale, E.M.L., Forrest, J.J.H.: Global optimization using special ordered sets. Math. Program. 10, 52\u201369 (1976)","journal-title":"Math. Program."},{"key":"138_CR6","first-page":"447","volume-title":"Proceedings of the Fifth International Conference on Operational Research","author":"EML Beale","year":"1970","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for nonconvex problems using ordered sets of variables. In: Lawrence, J. (ed.) Proceedings of the Fifth International Conference on Operational Research, pp. 447\u2013454. Tavistock Publications, London (1970)"},{"key":"138_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"138_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1137\/090772204","volume":"21","author":"DP Bertsekas","year":"2011","unstructured":"Bertsekas, D.P., Yu, H.: A unifying polyhedral approximation framework for convex optimization. SIAM J. Optim. 21, 333\u2013360 (2011)","journal-title":"SIAM J. Optim."},{"key":"138_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A.R., Cornuejols, G., Grossmann, I.E., Laird, C.D., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5, 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"138_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"138_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2014a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15, 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"138_CR12","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1023\/A:1013178600790","volume":"104","author":"JW Chinneck","year":"2001","unstructured":"Chinneck, J.W.: Analyzing mathematical programs using MProbe. Ann. Oper. Res. 104, 33\u201348 (2001)","journal-title":"Ann. Oper. Res."},{"key":"138_CR13","unstructured":"CMU-IBM open source MINLP project test set. \n                    http:\/\/egon.cheme.cmu.edu\/ibm\/page.htm"},{"key":"138_CR14","unstructured":"COIN-OR Project. CBC 2.9.7 Coin Branch and Cut programming solver. \n                    https:\/\/projects.coin-or.org\/Cbc"},{"key":"138_CR15","unstructured":"COIN-OR Project. FilterSD 2 Coin FilterSD solver. \n                    https:\/\/projects.coin-or.org\/filterSD"},{"key":"138_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E Dolan","year":"2002","unstructured":"Dolan, E., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"138_CR17","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s10601-009-9076-1","volume":"15","author":"F Domes","year":"2010","unstructured":"Domes, F., Neumaier, A.: Constraint propagation on quadratic constraints. Constraints 15, 404\u2013429 (2010)","journal-title":"Constraints"},{"key":"138_CR18","unstructured":"Drud, A.: CONOPT 3.17A, User\u2019s Manual. ARKI Consulting and Development A\/S, Bagsvaerd, Denmark (2016)"},{"key":"138_CR19","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran, M.A., Grossmann, I.E.: An outer-approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program. 36, 307\u2013339 (1986)","journal-title":"Math. Program."},{"key":"138_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1090.0321","volume":"22","author":"R Fourer","year":"2010","unstructured":"Fourer, R., Maheshwari, C., Neumaier, A., Orban, D., Schichl, H.: Convexity and concavity detection in computational graphs: tree walks for convexity assessment. INFORMS J. Comput. 22, 26\u201343 (2010)","journal-title":"INFORMS J. Comput."},{"key":"138_CR21","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10287-009-0101-z","volume":"7","author":"R Fourer","year":"2010","unstructured":"Fourer, R., Orban, D.: DrAmpl: a meta solver for optimization problem analysis. CMS 7, 437\u2013463 (2010)","journal-title":"CMS"},{"key":"138_CR22","unstructured":"Gamrath, G., Fischer, T., Gally, T., Gleixner, A.M., Hendel, G., Koch, Th., Maher, S.J., Miltenberger, M., M\u00fcller, B., Pfetsch, M.E., Puchert, Ch., Rehfeldt, D., Schenker, S., Schwarz, R., Serrano, F., Shinano, Y., Vigerske, S., Weninger, D., Winkler, M., Witt, J.T., Witzig, J.: The scip optimization suite 3.2. Technical Report 15-60, ZIB (2016)"},{"key":"138_CR23","unstructured":"GAMS Performance tools. \n                    http:\/\/www.gamsworld.org\/performance\/tools.htm\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR24","unstructured":"GAMS\/EXAMINER: User\u2019s Manual. \n                    https:\/\/www.gams.com\/latest\/docs\/S_EXAMINER.html\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR25","unstructured":"GAMS\/SBB: User\u2019s Manual. \n                    https:\/\/www.gams.com\/latest\/docs\/S_SBB.html\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR26","unstructured":"Gill, P.E., Murray, W., Saunders, M.A.: User\u2019s Guide for SNOPT 7: A FORTRAN Package for Large-Scale Nonlinear Programming. Technical report, University of California, San Diego and Stanford University, CA (2008)"},{"key":"138_CR27","unstructured":"GLOBAL Library. \n                    http:\/\/www.gamsworld.org\/global\/globallib.htm\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR28","unstructured":"Grant,M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. \n                    http:\/\/cvxr.com\/cvx\n                    \n                  , (2014, March)"},{"key":"138_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/0-387-30528-9_7","volume-title":"Chapter in Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications","author":"M Grant","year":"2006","unstructured":"Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Liberti, L., Maculan, N. (eds.) Chapter in Global Optimization: From Theory to Implementation, Nonconvex Optimization and Its Applications, pp. 155\u2013210. Springer, Boston, MA (2006)"},{"key":"138_CR30","unstructured":"IBM: CPLEX Optimizer (2016). \n                    http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR31","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1080\/10556780802614051","volume":"24","author":"RB Kearfott","year":"2009","unstructured":"Kearfott, R.B.: GlobSol user guide. Optim. Methods Softw. 24, 687\u2013708 (2009)","journal-title":"Optim. Methods Softw."},{"key":"138_CR32","first-page":"703","volume":"8","author":"JE Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting plane method for solving convex programs. J. SIAM 8, 703\u2013712 (1960)","journal-title":"J. SIAM"},{"key":"138_CR33","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"key":"138_CR34","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"key":"138_CR35","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, ChA: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Global Optim. 59, 503\u2013526 (2014)","journal-title":"J. Global Optim."},{"key":"138_CR36","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1137\/070704186","volume":"30","author":"M Monnigmann","year":"2008","unstructured":"Monnigmann, M.: Efficient calculation of bounds on spectra of Hessian matrices. SIAM J. Sci. Comput. 30, 2340\u20132357 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"138_CR37","unstructured":"Murtagh, B.A., Saunders, M.A.: MINOS 5.5 User\u2019s Guide. Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, CA (1995)"},{"key":"138_CR38","unstructured":"Nenov, I., Fylstra, D., Kolev, L.: Convexity determination in the microsoft excel solver using automatic differentiation techniques. In: The 4th International Conference on Automatic Differentiation (2004)"},{"key":"138_CR39","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer linear programming. Math. Program. 99, 283\u2013296 (2004)","journal-title":"Math. Program."},{"key":"138_CR40","unstructured":"Princeton Library. \n                    http:\/\/www.gamsworld.org\/performance\/princetonlib\/princetonlib.htm\n                    \n                  . Accessed 7 May 2018"},{"key":"138_CR41","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF01580581","volume":"34","author":"JB Rosen","year":"1986","unstructured":"Rosen, J.B., Pardalos, P.M.: Global minimization of large-scale constrained concave quadratic problems by separable programming. Math. Program. 34, 163\u2013174 (1986)","journal-title":"Math. Program."},{"key":"138_CR42","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8, 107\u2013139 (1996)","journal-title":"J. Global Optim."},{"key":"138_CR43","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: BARON: a general purpose global optimization software package. J. Global Optim. 8, 201\u2013205 (1996)","journal-title":"J. Global Optim."},{"key":"138_CR44","unstructured":"Sahinidis, N.V.: BARON 12.1.0: Global Optimization of Mixed-Integer Nonlinear Programs, User\u2019s Manual (2013)"},{"key":"138_CR45","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"138_CR46","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"138_CR47","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"138_CR48","unstructured":"Vigerske, S.: Decomposition in multistage stochastic programming and a constraint integer programming approach to mixed-integer nonlinear programming. PhD thesis, Humboldt-Universit\u00e4t zu, Berlin (2012)"},{"key":"138_CR49","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of a primal-dual interior point filter line search algorithm for large-scale nonlinear programming. Math. Program. 106, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"138_CR50","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1023\/A:1021091110342","volume":"3","author":"T Westerlund","year":"2002","unstructured":"Westerlund, T., P\u00f6rn, R.: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques. Optim. Eng. 3, 253\u2013280 (2002)","journal-title":"Optim. Eng."}],"container-title":["Mathematical Programming Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12532-018-0138-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0138-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12532-018-0138-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:24:02Z","timestamp":1557793442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12532-018-0138-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,14]]},"references-count":50,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["138"],"URL":"https:\/\/doi.org\/10.1007\/s12532-018-0138-5","relation":{},"ISSN":["1867-2949","1867-2957"],"issn-type":[{"value":"1867-2949","type":"print"},{"value":"1867-2957","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,14]]},"assertion":[{"value":"31 May 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}