{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T08:54:39Z","timestamp":1772614479500,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,2,18]],"date-time":"2015-02-18T00:00:00Z","timestamp":1424217600000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10898-015-0284-5","type":"journal-article","created":{"date-parts":[[2015,2,17]],"date-time":"2015-02-17T13:09:51Z","timestamp":1424178591000},"page":"213-227","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Convex mixed integer nonlinear programming problems and an outer approximation algorithm"],"prefix":"10.1007","volume":"63","author":[{"given":"Zhou","family":"Wei","sequence":"first","affiliation":[]},{"given":"M. Montaz","family":"Ali","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,2,18]]},"reference":[{"key":"284_CR1","volume-title":"Set-valued Analysis","author":"JP Aubin","year":"1990","unstructured":"Aubin, J.P., Frankowska, H.: Set-valued Analysis. Birkh\u00e4user, Boston (1990)"},{"issue":"2","key":"284_CR2","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L., Conn, A.R., Cornu\u00e9jols, G., Grossmann, I.E., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete. Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete. Optim."},{"key":"284_CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.compchemeng.2005.07.012","volume":"30","author":"I Castillo","year":"2005","unstructured":"Castillo, I., Westerlund, J., Emet, S., Westerlund, T.: Optimization of block layout design problems with unequal areas: a comparison of MILP and MINLP optimization methods. Comput. Chem. Eng. 30, 54\u201369 (2005)","journal-title":"Comput. Chem. Eng."},{"key":"284_CR4","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-1-4614-1927-3_2","volume":"154","author":"S Drewes","year":"2012","unstructured":"Drewes, S., Ulbrich, S.: Subgradient based outer approximation for mixed integer second order cone pogramming. Mixed Integer Nonlinear Prog. IMA Vol. Math. Appl. 154, 41\u201359 (2012)","journal-title":"IMA Vol. Math. Appl."},{"key":"284_CR5","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M Duran","year":"1986","unstructured":"Duran, M., 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":"284_CR6","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1080\/02331934.2012.712118","volume":"63","author":"V-P Eronen","year":"2014","unstructured":"Eronen, V.-P., M\u00e4kel\u00e4, M.M., Westerlund, T.: On the generalization of ECP and OA methods to nonsmooth convex MINLP problems. Optimization 63, 1057\u20131073 (2014)","journal-title":"Optimization"},{"key":"284_CR7","author":"V-P Eronen","year":"2013","unstructured":"Eronen, V.-P., M\u00e4kel\u00e4, M.M., Westerlund, T.: Extended cutting plane method for a class of nonsmooth nonconvex MINLP problems. Optimization (2013). doi: 10.1080\/02331934.2013.796473","journal-title":"Optimization"},{"key":"284_CR8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher, R., Leyffer, S.: Solving mixed-integer nonlinear programs by outer approximation. Math. Prog. 66, 327\u2013349 (1994)","journal-title":"Math. Prog."},{"key":"284_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF01580620","volume":"60","author":"Decomposition in general mathematical programming","year":"1993","unstructured":"Decomposition in general mathematical programming: Flippo, O.E., Rinnooy Kan, A.H.G. Math. Prog. 60, 361\u2013382 (1993)","journal-title":"Math. Prog."},{"key":"284_CR10","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed Integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)"},{"issue":"4","key":"284_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. J. Optim. Theory. Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory. Appl."},{"key":"284_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/A:1021039126272","volume":"3","author":"IE Grossmann","year":"2002","unstructured":"Grossmann, I.E.: Review of nonlinear mixed-integer and disjunctive programming techniques. Optim. Eng. 3, 227\u2013252 (2002)","journal-title":"Optim. Eng."},{"key":"284_CR13","unstructured":"Grossmann, I. E., Sahinidis, N. V. (eds): Special Issue on Mixed-Integer Programming and Its Application to Engineering, Part I, Optim. Eng., vol. 3(4), Kluwer Academic Publishers, Netherlands (2002)"},{"key":"284_CR14","unstructured":"Grossmann, I. E., Sahinidis, N. V. (eds): Special Issue on Mixed-Integer Programming and Its Application to Engineering, Part II, Optim. Eng., vol. 4(1), Kluwer Academic Publishers, Netherlands (2002)"},{"key":"284_CR15","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1023\/A:1011241421041","volume":"18","author":"S Leyffer","year":"2001","unstructured":"Leyffer, S.: Integrating SQP and branch-and-bound for mixed integer nonlinear programming. Comput. Optim. Appl. 18, 295\u2013309 (2001)","journal-title":"Comput. Optim. Appl."},{"key":"284_CR16","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.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Global. Optim. 36, 161\u2013189 (2006)","journal-title":"J. Global. Optim."},{"key":"284_CR17","first-page":"253","volume-title":"Integer Programming: Theory and Practice, Operations Research Series","author":"JT Linderoth","year":"2005","unstructured":"Linderoth, J.T., Ralphs, T.K.: Noncommercial software for mixed-integer linear programming. In: Karlof, J. (ed.) Integer Programming: Theory and Practice, Operations Research Series, pp. 253\u2013303. CRC Press, Boca Raton (2005)"},{"key":"284_CR18","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF01582893","volume":"52","author":"P Michelon","year":"1991","unstructured":"Michelon, P., Maculan, N.: Lagrangean decomposition for integer nonlinear programming with linear constraints. Math. Program. 52, 303\u2013313 (1991)","journal-title":"Math. Program."},{"issue":"2","key":"284_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10100-007-0051-x","volume":"16","author":"I Nowak","year":"2008","unstructured":"Nowak, I., Vigerske, S.: LaGO: a (heuristic) branch and cut algorithm for nonconvex MINLPs. Cent. Eur. J. Oper. Res 16(2), 127\u2013138 (2008)","journal-title":"Cent. Eur. J. Oper. Res"},{"key":"284_CR20","series-title":"Lecture Notes in Math","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21569-2","volume-title":"Convex functions, Monotone Operators and Differentiability","author":"RR Phelps","year":"1989","unstructured":"Phelps, R.R.: Convex functions, Monotone Operators and Differentiability. Lecture Notes in Math, vol. 1364. Springer, New York (1989)"},{"key":"284_CR21","doi-asserted-by":"crossref","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":"284_CR22","doi-asserted-by":"crossref","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, Netherlands (2002)"},{"key":"284_CR23","doi-asserted-by":"crossref","unstructured":"Wei, Z., Ali, M.M.: Outer approximation algorithm for one class of convex mixed-integer nonlinear programming problems with partial differentiability. J. Optim. Theory. Appl. doi: 10.1007\/s10957-015-0715-y","DOI":"10.1007\/s10957-015-0715-y"},{"key":"284_CR24","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund, T., Pettersson, F.: An extended cutting plane method for solving convex MINLP problems. Computer. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Computer. Chem. Eng."},{"key":"284_CR25","doi-asserted-by":"crossref","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."},{"key":"284_CR26","doi-asserted-by":"crossref","DOI":"10.1142\/5021","volume-title":"Convex Analysis in General Vector Spaces","author":"C Z\u01celinescu","year":"2002","unstructured":"Z\u01celinescu, C.: Convex Analysis in General Vector Spaces. World Scientific, Singapore (2002)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0284-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0284-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0284-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T23:22:38Z","timestamp":1651274558000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0284-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2,18]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["284"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0284-5","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2,18]]}}}