{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T08:22:34Z","timestamp":1790497354724,"version":"4.1.0"},"reference-count":39,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-15-1-2226"],"award-info":[{"award-number":["N00014-15-1-2226"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We study two-stage stochastic mixed integer programs (TSS-MIPs) with integer variables in the second stage. We show that under suitable conditions, the second stage MIPs can be convexified by adding parametric cuts a priori. As special cases, we extend the results of Miller and Wolsey [ Math. Program., 98 (2003), pp. 73--88] to TSS-MIPs. Furthermore, we consider second stage programs that are generalizations of the well-known mixing (and continuous mixing) set, or certain piecewise-linear convex objective integer programs. These results allow us to relax the integrality restrictions on the second stage integer variables without effecting the integrality of the optimal solution of the TSS-MIP. We also use four variants of the two-stage stochastic capacitated lot-sizing problems as test problems for computational experiments and present tight second stage formulations for these problems. Our computational results show that adding parametric inequalities that a priori convexify the second stage formulation significantly reduces the total solution time taken to solve these problems.<\/jats:p>","DOI":"10.1137\/16m1083955","type":"journal-article","created":{"date-parts":[[2018,3,15]],"date-time":"2018-03-15T15:21:59Z","timestamp":1521127319000},"page":"788-819","source":"Crossref","is-referenced-by-count":14,"title":["Tight Second Stage Formulations in Two-Stage Stochastic Mixed Integer Programs"],"prefix":"10.1137","volume":"28","author":[{"given":"Manish","family":"Bansal","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuo-Ling","family":"Huang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Mehrotra","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,3,15]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0475-6"},{"key":"atypb2","doi-asserted-by":"crossref","unstructured":"M. Bansal,\n                      Facets for Continuous Multi-Mixing Set and Its Generalizations: Strong Cuts for Multi-Module Capacitated Lot-Sizing Problem\n                      , Ph.D. thesis, Texas A&M University, 2014.","DOI":"10.1007\/978-3-319-07557-0_9"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0906-1"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2017.05.002"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07557-0_9"},{"key":"atypb6","doi-asserted-by":"crossref","unstructured":"M. S. Bazaraa, H. D. Sherali, and C. M. Shetty,\n                      Nonlinear Programming: Theory and Algorithms\n                      , 3rd ed., Wiley, New York, 2006.","DOI":"10.1002\/0471787779"},{"key":"atypb7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386316"},{"key":"atypb8","unstructured":"J. R. Birge and F. V. Louveaux,\n                      Introduction to Stochastic Programming\n                      , Springer, Berlin, 1997."},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2016.0717"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.2016.2455"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00399-2"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0615-y"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011430"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2015.1421"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0529-8"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0711-y"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0385-3"},{"key":"atypb18","first-page":"1","author":"Ku\u0308cu\u0308kyavuz S.","year":"2017","journal-title":"INFORMS Tutor. Oper. Res."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(93)90002-X"},{"key":"atypb20","first-page":"213","author":"Louveaux F. V.","year":"2003","journal-title":"New York"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0397-3"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1287\/opre.51.4.557.16094"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585752"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1090.0693"},{"key":"atypb25","first-page":"385","volume":"32","author":"Ntaimo L.","year":"2005","journal-title":"for stochastic combinatorial optimization, J. Global Optim."},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-007-9085-1"},{"key":"atypb27","first-page":"177","author":"Ro\u0308misch W.","year":"2010","journal-title":"Berlin"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02680560"},{"key":"atypb29","first-page":"515","volume":"12","author":"Sen S.","year":"2005","journal-title":"Handb. Oper. Res. Manag. Sci."},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0566-z"},{"key":"atypb31","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-005-0592-5"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013827731218"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0724-6"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1137\/0117061"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.02.025"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1040.0130"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2013.04.017"},{"key":"atypb38","unstructured":"L. A. Wolsey,\n                      Integer Programming\n                      , Wiley, New York, 1998."},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/13092678X"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1083955","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:15:52Z","timestamp":1787336152000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1083955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1083955"],"URL":"https:\/\/doi.org\/10.1137\/16m1083955","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}