{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T18:47:28Z","timestamp":1776106048234,"version":"3.50.1"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,2,17]],"date-time":"2012-02-17T00:00:00Z","timestamp":1329436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10107-012-0517-z","type":"journal-article","created":{"date-parts":[[2012,2,16]],"date-time":"2012-02-16T02:29:46Z","timestamp":1329359386000},"page":"217-255","source":"Crossref","is-referenced-by-count":6,"title":["The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints"],"prefix":"10.1007","volume":"141","author":[{"given":"Ming","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Ismael Regis","family":"de Farias","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,2,17]]},"reference":[{"key":"517_CR1","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"2006","unstructured":"Bazaraa M.S., Sherali H.D., Shetty C.M.: Nonlinear Programming: Theory and Algorithms, 3rd edn. Wiley, London (2006)","edition":"3"},{"key":"517_CR2","unstructured":"Beale, E.M.L.:Two transportation problems. In: Kreweras, G., Morlat, G. (eds.) Proceedings of the Third International Conference on Operational Research, pp. 780\u2013788. Dunod, Paris (1963)"},{"key":"517_CR3","volume-title":"Mathematical Programming in Practice","author":"E.M.L. Beale","year":"1968","unstructured":"Beale E.M.L.: Mathematical Programming in Practice. Pitmans, London (1968)"},{"key":"517_CR4","doi-asserted-by":"crossref","unstructured":"Beale, E.M.L.: Branch-and-bound methods in mathematical programming systems. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (eds.) Annals of Discrete Mathematics 5: Discrete Optimization, pp. 201\u2013219. North Holland (1979)","DOI":"10.1016\/S0167-5060(08)70351-0"},{"key":"517_CR5","unstructured":"Beale, E.M.L.: Branch and bound methods for numerical optimization. In:Barrit, M.M., Wishart, D. (eds.) COMPSTAT 80: Proceedings in Computational Statistics, pp. 11\u201320. Physica Verlag, Vienna (1980)"},{"key":"517_CR6","doi-asserted-by":"crossref","unstructured":"Beale, E.M.L.:Integer programming. In: Sciitkowski, K. (ed.) Computational Mathematical Programming, NATO ASI Series, vol. f15, pp. 1\u201324. Springer, Berlin (1985)","DOI":"10.1007\/978-3-642-82450-0_1"},{"key":"517_CR7","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 Operations Research, pp. 447\u2013454. Tavistock Publications (1970)"},{"key":"517_CR8","volume-title":"Systematic Methods of Chemical Process Design","author":"L.T. Biegler","year":"1997","unstructured":"Biegler L.T., Grossmann I.E., Westerberg A.W.: Systematic Methods of Chemical Process Design. Prentice Hall, Englewood Cliffs (1997)"},{"key":"517_CR9","first-page":"121","volume":"74","author":"D. Bienstock","year":"1996","unstructured":"Bienstock D.: Computational study of a family of mixed-integer quadratic programming problems. Math. Program. 74, 121\u2013140 (1996)","journal-title":"Math. Program."},{"key":"517_CR10","volume-title":"Applied Mathematical Programming","author":"S.P. Bradley","year":"1977","unstructured":"Bradley S.P., Hax A.C., Magnanti T.L.: Applied Mathematical Programming. Addison-Wesley, Reading (1977)"},{"key":"517_CR11","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCS.1977.1084349","volume":"24","author":"M.J. Chien","year":"1977","unstructured":"Chien M.J., Kuh E.S.: Solving nonlinear resistive networks using piecewise linear analysis and simplicial subdivision. IEEE Trans. Circuits Syst. 24, 305\u2013317 (1977)","journal-title":"IEEE Trans. Circuits Syst."},{"key":"517_CR12","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1287\/opre.31.5.803","volume":"31","author":"H. Crowder","year":"1983","unstructured":"Crowder H., Johnson E.L., Padberg M.: Solving large-scale zero-one linear programming problems. Oper. Res. 31, 803\u2013834 (1983)","journal-title":"Oper. Res."},{"key":"517_CR13","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1287\/mnsc.49.9.1268.16570","volume":"49","author":"K.L. Croxton","year":"2003","unstructured":"Croxton K.L., Gendron B., Magnanti T.L.: A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Manag. Sci. 49, 1268\u20131273 (2003)","journal-title":"Manag. Sci."},{"key":"517_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.37.1.1.12822","volume":"37","author":"K.L. Croxton","year":"2003","unstructured":"Croxton K.L., Gendron B., Magnanti T.L.: Models and methods for merge-in-transit operations. Transp. Sci. 37, 1\u201322 (2003)","journal-title":"Transp. Sci."},{"key":"517_CR15","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs. Operations Research Center, Massachusetts Institute of Technology (2003)"},{"key":"517_CR16","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.orl.2009.09.005","volume":"38","author":"C. D\u2019Ambrosio","year":"2010","unstructured":"D\u2019Ambrosio C., Lodi A., Martello S.: Piecewise linear approximation of functions of two variables in MILP models. Oper. Res. Lett. 38, 39\u201346 (2010)","journal-title":"Oper. Res. Lett."},{"key":"517_CR17","doi-asserted-by":"publisher","first-page":"30","DOI":"10.2307\/1905292","volume":"28","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig G.B.: On the significance of solving linear programming problems with some integer variables. Econometrica 28, 30\u201344 (1960)","journal-title":"Econometrica"},{"key":"517_CR18","doi-asserted-by":"crossref","unstructured":"de Farias, I.R. Jr.: Semi-continuous cuts for mixed-integer programming. In: Bienstock, D., Nemhauser, G.L. (eds.) Integer Programming and Combinatorial Optimization (IPCO), Lecture Notes in Computer Science, vol. 3064, pp. 163\u2013177. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-25960-2_13"},{"key":"517_CR19","doi-asserted-by":"crossref","unstructured":"de Farias, I.R. Jr., Gupta, R., Kozyreff, E., Zhao, M.: Branch-and-Cut for Separable Piecewise Linear Optimization and Intersection with Semi-Continuous Constraints. Texas Tech University (2011)","DOI":"10.1007\/s12532-012-0049-9"},{"key":"517_CR20","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/PL00011392","volume":"89","author":"I.R. Farias de Jr","year":"2000","unstructured":"de Farias I.R., Johnson E.L., Nemhauser G.L.: A generalized assignment problem with special ordered sets: a polyhedral approach. Math. Program. 89, 187\u2013203 (2000)","journal-title":"Math. Program."},{"key":"517_CR21","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1017\/S0269888901000030","volume":"16","author":"I.R. Farias de Jr","year":"2001","unstructured":"de Farias I.R., Johnson E.L., Nemhauser G.L.: Branch-and-cut for combinatorial optimization problems without auxiliary binary variables. Knowl. Eng. Rev. 16, 25\u201339 (2001)","journal-title":"Knowl. Eng. Rev."},{"key":"517_CR22","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/S0167-6377(01)00086-4","volume":"29","author":"I.R. Farias de Jr","year":"2001","unstructured":"de Farias I.R., Nemhauser G.L.: A family of inequalities for the generalized assignment problem. Oper. Res. Lett. 29, 49\u201351 (2001)","journal-title":"Oper. Res. Lett."},{"key":"517_CR23","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/s10107-003-0420-8","volume":"96","author":"I.R. Farias de Jr","year":"2003","unstructured":"de Farias I.R., Nemhauser G.L.: A polyhedral study of the cardinality constrained knapsack problem. Math. Program. 96, 439\u2013467 (2003)","journal-title":"Math. Program."},{"key":"517_CR24","unstructured":"de Farias, I.R. Jr., Zhao, M.: A Polyhedral Study of the Semi-Continuous Knapsack Problem. Texas Tech University (2011)"},{"key":"517_CR25","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1016\/j.orl.2007.05.004","volume":"36","author":"I.R. Farias de Jr","year":"2008","unstructured":"de Farias I.R., Zhao M., Zhao H.: A special ordered set approach for optimizing a discontinuous separable piecewise linear function. Oper. Res. Lett. 36, 234\u2013238 (2008)","journal-title":"Oper. Res. Lett."},{"key":"517_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01584975","volume":"3","author":"B.C. Eaves","year":"1972","unstructured":"Eaves B.C.: Homotopies for computation of fixed points. Math. Program. 3, 1\u201322 (1972)","journal-title":"Math. Program."},{"key":"517_CR27","volume-title":"AMPL\u2014a modeling language for mathematical programming","author":"R. Fourer","year":"1993","unstructured":"Fourer R., Gay D.M., Kerninghan B.W.: AMPL\u2014a modeling language for mathematical programming. The Scientific Press, Redwood City (1993)"},{"key":"517_CR28","doi-asserted-by":"publisher","first-page":"1490","DOI":"10.1137\/060663799","volume":"30","author":"A. F\u00fcgenschuh","year":"2008","unstructured":"F\u00fcgenschuh A., G\u00f6ttlich S., Martin A.: A discrete optimization approach to large scale supply networks based on partial differential equations. SIAM J. Sci. Comput. 30, 1490\u20131507 (2008)","journal-title":"SIAM J. Sci. Comput."},{"key":"517_CR29","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0898-1221(90)90111-V","volume":"20","author":"T. Graf","year":"1990","unstructured":"Graf T., van Hentenryck P., Lasserre C., Zimmer L.: Simulation of hybrid circuits in constraint logic programming. Comput. Math. Appl. 20, 45\u201356 (1990)","journal-title":"Comput. Math. Appl."},{"key":"517_CR30","unstructured":"http:\/\/www.hpcc.ttu.edu\/index.php"},{"key":"517_CR31","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/S0167-6377(03)00059-2","volume":"32","author":"A.B. Keha","year":"2004","unstructured":"Keha A.B., de Farias I.R., Nemhauser G.L.: Models for representing piecewise linear cost functions. Oper. Res. Lett. 32, 44\u201348 (2004)","journal-title":"Oper. Res. Lett."},{"key":"517_CR32","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.1060.0277","volume":"54","author":"A.B. Keha","year":"2006","unstructured":"Keha A.B., de Farias I.R., Nemhauser G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54, 847\u2013858 (2006)","journal-title":"Oper. Res."},{"key":"517_CR33","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/PL00011397","volume":"89","author":"H. Konno","year":"2001","unstructured":"Konno H., Wijayanayake A.: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints. Math. Program. 89, 233\u2013250 (2001)","journal-title":"Math. Program."},{"key":"517_CR34","doi-asserted-by":"publisher","first-page":"84","DOI":"10.2307\/1907744","volume":"25","author":"H.M. Markowitz","year":"1957","unstructured":"Markowitz H.M., Manne A.S.: On the solution of discrete programming problems. Econometrica 25, 84\u2013110 (1957)","journal-title":"Econometrica"},{"key":"517_CR35","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A. Martin","year":"2006","unstructured":"Martin A., M\u00f6ller M., Moritz S.: Mixed-integer models for the stationary case of gas network optimization. Math. Program. 105, 563\u2013582 (2006)","journal-title":"Math. Program."},{"key":"517_CR36","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01262932","volume":"16","author":"R.R. Meyer","year":"1975","unstructured":"Meyer R.R.: Integer and mixed-integer programming models: general properties. J. Optim. Theory Appl. 16, 191\u2013206 (1975)","journal-title":"J. Optim. Theory Appl."},{"key":"517_CR37","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(76)90145-X","volume":"16","author":"R.R. Meyer","year":"1976","unstructured":"Meyer R.R.: Mixed- integer minimization models for piecewise-linear functions of a single variable. Discret. Math. 16, 163\u2013171 (1976)","journal-title":"Discret. Math."},{"key":"517_CR38","doi-asserted-by":"publisher","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal J., Wright S.J.: Numerical Optimization. Springer, Berlin (1999)"},{"key":"517_CR39","doi-asserted-by":"publisher","first-page":"1143","DOI":"10.1287\/mnsc.30.10.1143","volume":"30","author":"A.F. Perold","year":"1984","unstructured":"Perold A.F.: Large-scale portfolio optimization. Manag. Sci. 30, 1143\u20131160 (1984)","journal-title":"Manag. Sci."},{"key":"517_CR40","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1109\/TPWRS.2008.919246","volume":"23","author":"R. Sioshansi","year":"2008","unstructured":"Sioshansi R., O\u2019Neill R.O., Oren S.S.: Economic consequences of alternative solution methods for centralized unit commitment in day-ahead electricity markets. IEEE Trans. Power Syst. 23, 344\u2013352 (2008)","journal-title":"IEEE Trans. Power Syst."},{"key":"517_CR41","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/59.535691","volume":"11","author":"S. Takriti","year":"1996","unstructured":"Takriti S., Birge J.R., Long E.: A stochastic model for the unit commitment problem. IEEE Trans. Power Syst. 11, 1497\u20131508 (1996)","journal-title":"IEEE Trans. Power Syst."},{"key":"517_CR42","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/opre.48.2.268.12379","volume":"48","author":"S. Takriti","year":"2000","unstructured":"Takriti S., Krasenbrink B., Wu L.S.Y.: Incorporating fuel constraints and electricity spot prices into the stochastic unit commitment problem. Oper. Res. 48, 268\u2013280 (2000)","journal-title":"Oper. Res."},{"key":"517_CR43","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/BF01580679","volume":"10","author":"M.J. Todd","year":"1976","unstructured":"Todd M.J.: On triangulations for computing fixed points. Math. Program. 10, 322\u2013346 (1976)","journal-title":"Math. Program."},{"key":"517_CR44","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/BF01589393","volume":"42","author":"J.A. Tomlin","year":"1988","unstructured":"Tomlin J.A.: Special ordered sets and an application to gas supply operations planning. Math. Program. 42, 69\u201384 (1988)","journal-title":"Math. Program."},{"key":"517_CR45","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"J.P. Vielma","year":"2010","unstructured":"Vielma J.P., Ahmed S., Nemhauser G.L.: Mixed-integer models for nonseparable piecewise linear optimization: unifying framework and extensions. Oper. Res. 58, 303\u2013315 (2010)","journal-title":"Oper. Res."},{"key":"517_CR46","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.disopt.2007.07.001","volume":"5","author":"J.P. Vielma","year":"2008","unstructured":"Vielma J.P., Keha A.B., Nemhauser G.L.: Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5, 467\u2013488 (2008)","journal-title":"Discret. Optim."},{"key":"517_CR47","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"J.P. Vielma","year":"2011","unstructured":"Vielma J.P., Nemhauser G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128, 49\u201372 (2011)","journal-title":"Math. Program."},{"key":"517_CR48","volume-title":"Two-Stage Robust Unit Commitment Problem","author":"M. Zhang","year":"2009","unstructured":"Zhang M., Guan Y.: Two-Stage Robust Unit Commitment Problem. University of Florida, Gainesville (2009)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0517-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0517-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0517-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0517-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T19:31:52Z","timestamp":1581967912000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0517-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,17]]},"references-count":48,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["517"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0517-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,17]]}}}