{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T10:21:09Z","timestamp":1780395669641,"version":"3.54.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,6,12]],"date-time":"2015-06-12T00:00:00Z","timestamp":1434067200000},"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. Program."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10107-015-0919-9","type":"journal-article","created":{"date-parts":[[2015,6,11]],"date-time":"2015-06-11T16:03:01Z","timestamp":1434038581000},"page":"175-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":80,"title":["A polyhedral study of production ramping"],"prefix":"10.1007","volume":"158","author":[{"given":"Pelin","family":"Damc\u0131-Kurt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Deepak","family":"Rajan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,6,12]]},"reference":[{"key":"919_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0167-6377(99)00030-9","volume":"25","author":"A Agra","year":"1999","unstructured":"Agra, A., Constantino, M.: Lotsizing with backlogging and start-ups: the case of Wagner\u2013Whitin costs. Oper. Res. Lett. 25, 81\u201388 (1999)","journal-title":"Oper. Res. Lett."},{"key":"919_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"MS Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M.S., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Oper. Res. Lett. 37, 187\u2013191 (2009)","journal-title":"Oper. Res. Lett."},{"key":"919_CR3","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1049\/ip-d.1980.0044","volume":"127","author":"LF Baptisella","year":"1980","unstructured":"Baptisella, L.F., Geromel, J.: A decomposition approach to problem of unit commitment schedule for hydrothermal systems. IEEE Proc. D Control Theory Appl. 127, 250\u2013258 (1980)","journal-title":"IEEE Proc. D Control Theory Appl."},{"key":"919_CR4","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/TPWRS.2006.876672","volume":"21","author":"M Carrion","year":"2006","unstructured":"Carrion, M., Arroyo, J.M.: A computationally efficient mixed integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 21, 1371\u20131378 (2006)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR5","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1109\/TPAS.1983.317714","volume":"PAS\u2013102","author":"AI Cohen","year":"1983","unstructured":"Cohen, A.I., Yoshimura, M.: A branch and bound algorithm for unit commitment. IEEE Trans. Power Appar. Syst. PAS\u2013102, 444\u2013451 (1983)","journal-title":"IEEE Trans. Power Appar. Syst."},{"key":"919_CR6","first-page":"353","volume":"75","author":"M Constantino","year":"1996","unstructured":"Constantino, M.: A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Program. 75, 353\u2013376 (1996)","journal-title":"Math. Program."},{"key":"919_CR7","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/moor.23.1.101","volume":"23","author":"M Constantino","year":"1998","unstructured":"Constantino, M.: Lower bounds in lot-sizing models: a polyhedral study. Math. Oper. Res. 23, 101\u2013118 (1998)","journal-title":"Math. Oper. Res."},{"key":"919_CR8","unstructured":"Damc\u0131-Kurt, P.: Mixed-integer programming methods for transportation and power generation problems. Ph.D. Thesis, The Ohio State University (2014)"},{"key":"919_CR9","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0378-7796(02)00043-3","volume":"62","author":"W Fan","year":"2002","unstructured":"Fan, W., Guan, X., Zhai, Q.: A new method for unit commitment with ramping constraints. Electr. Power Syst. Res. 62, 215\u2013224 (2002)","journal-title":"Electr. Power Syst. Res."},{"key":"919_CR10","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/opre.1060.0309","volume":"54","author":"A Frangioni","year":"2006","unstructured":"Frangioni, A., Gentile, C.: Solving nonlinear single-unit commitment problems with ramping constraints. Oper. Res. 54, 767\u2013775 (2006)","journal-title":"Oper. Res."},{"key":"919_CR11","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1016\/j.ijepes.2007.10.003","volume":"30","author":"A Frangioni","year":"2008","unstructured":"Frangioni, A., Gentile, C., Lacalandra, F.: Solving unit commitment problems with general ramp constraints. Int. J. Electr. Power Energy Syst. 30, 316\u2013326 (2008)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"919_CR12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TPWRS.2008.2004744","volume":"24","author":"A Frangioni","year":"2009","unstructured":"Frangioni, A., Gentile, C., Lacalandra, F.: Tighter approximated MILP formulations for unit commitment problems. IEEE Trans. Power Syst. 24, 105\u2013113 (2009)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR13","first-page":"730","volume":"81","author":"LL Garver","year":"1962","unstructured":"Garver, L.L.: Power generation scheduling by integer programming-development of theory. Trans. Am. Inst. Electr. Eng. Part III Power App. Syst. 81, 730\u2013734 (1962)","journal-title":"Trans. Am. Inst. Electr. Eng. Part III Power App. Syst."},{"key":"919_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.epsr.2012.07.020","volume":"95","author":"P Havel","year":"2013","unstructured":"Havel, P., \u0160imovi\u010d, T.: Optimal planning of cogeneration production with provision of ancillary services. Electr. Power Syst. Res. 95, 47\u201355 (2013)","journal-title":"Electr. Power Syst. Res."},{"key":"919_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/b108628","volume-title":"The Next Generation of Electric Power Unit Commitment Models","author":"BF Hobbs","year":"2001","unstructured":"Hobbs, B.F., Rothkopf, M.H., O\u2019Neill, R.P., Chao, H.-P.: The Next Generation of Electric Power Unit Commitment Models. Kluwer Academic Publishers, Norwell (2001)"},{"key":"919_CR16","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/59.485989","volume":"11","author":"SA Kazarlis","year":"1996","unstructured":"Kazarlis, S.A., Bakirtzis, A.G., Petridis, V.: A genetic algorithm solution to the unit commitment problem. IEEE Trans. Power Syst. 11, 83\u201392 (1996)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/j.disopt.2003.12.001","volume":"1","author":"J Lee","year":"2004","unstructured":"Lee, J., Leung, J., Margot, F.: Min-up\/min-down polytopes. Discrete Optim. 1, 77\u201385 (2004)","journal-title":"Discrete Optim."},{"key":"919_CR18","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1109\/TPAS.1966.291679","volume":"PAS\u201385","author":"PG Lowery","year":"1966","unstructured":"Lowery, P.G.: Generating unit commitment by dynamic programming. IEEE Trans. Power Appar. Syst. PAS\u201385, 422\u2013426 (1966)","journal-title":"IEEE Trans. Power Appar. Syst."},{"key":"919_CR19","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1049\/ip-gtd:19981681","volume":"145","author":"AH Mantawy","year":"1998","unstructured":"Mantawy, A.H., Abdel-Magid, Y.L., Selim, S.Z.: Unit commitment by tabu search. IEEE Proceed. Gener. Transm. Distrib. 145, 56\u201364 (1998)","journal-title":"IEEE Proceed. Gener. Transm. Distrib."},{"key":"919_CR20","doi-asserted-by":"crossref","unstructured":"Morales-Espa\u00f1a, G., Latorre, J.M., Ramos, A.: Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans. Power Syst. 28(4), 4897\u20134908 (2013)","DOI":"10.1109\/TPWRS.2013.2251373"},{"issue":"2","key":"919_CR21","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TPWRS.2012.2222938","volume":"28","author":"G Morales-Espa\u00f1a","year":"2013","unstructured":"Morales-Espa\u00f1a, G., Latorre, J.M., Ramos, A.: Tight and compact MILP formulation of start-up and shut-down ramping in unit commitment. IEEE Trans. Power Syst. 28(2), 1288\u20131296 (2013)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR22","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"919_CR23","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/59.667375","volume":"13","author":"SO Orero","year":"1998","unstructured":"Orero, S.O., Irving, M.R.: A genetic algorithm modeling framework and solution technique for short term optimal hydrothermal scheduling. IEEE Trans. Power Syst. 13, 501\u2013518 (1998)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR24","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/TPWRS.2011.2162008","volume":"27","author":"J Ostrowski","year":"2012","unstructured":"Ostrowski, J., Anjos, M.F., Vannelli, A.: Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Trans. Power Syst. 27, 39\u201346 (2012)","journal-title":"IEEE Trans. Power Syst."},{"issue":"5","key":"919_CR25","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1287\/mnsc.21.5.576","volume":"21","author":"D Pekelman","year":"1975","unstructured":"Pekelman, D.: Production smoothing with fluctuating price. Manag. Sci. 21(5), 576\u2013590 (1975)","journal-title":"Manag. Sci."},{"key":"919_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-45586-8_3","volume-title":"Computational Combinatorial Optimization, Lecture Notes in Computer Science LCNS","author":"Y Pochet","year":"2001","unstructured":"Pochet, Y.: Mathematical programming models and formulations for deterministic production planning problems. In: J\u00fcnger, M., Naddef, D. (eds.) Computational Combinatorial Optimization, Lecture Notes in Computer Science LCNS, vol. 2241, pp. 57\u2013111. Springer, Berlin (2001)"},{"key":"919_CR27","first-page":"245","volume-title":"Combinatorial Optimization, Volume 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"Y Pochet","year":"1995","unstructured":"Pochet, Y., Wolsey, L.: Algorithms and reformulations for lot sizing problems. In: Cook, W., Lovasz, L., Seymour, P. (eds.) Combinatorial Optimization, Volume 20 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pp. 245\u2013294. Applied Mathematical Society, Philadelphia (1995)"},{"key":"919_CR28","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.: Production Planning by Mixed Integer Programming. Springer, Berlin (2006)"},{"key":"919_CR29","unstructured":"Rajan, D., Takriti, S.: Minimum up\/down polytopes of the unit commitment problem with start-up costs. IBM Research Report RC23628, IBM, Yorktown Heights, NY (2005)"},{"key":"919_CR30","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.apenergy.2006.07.005","volume":"84","author":"A Rong","year":"2007","unstructured":"Rong, A., Lahdelma, R.: An effective heuristic for combined heat-and-power production planning with power ramp constraints. Appl. Energy 84, 307\u2013325 (2007)","journal-title":"Appl. Energy"},{"key":"919_CR31","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s11708-013-0240-3","volume":"7","author":"B Saravanan","year":"2013","unstructured":"Saravanan, B., Das, S., Sikri, S., Kothari, D.P.: A solution to the unit commitment problem\u2014a review. Front. Energy 7, 223\u2013236 (2013)","journal-title":"Front. Energy"},{"key":"919_CR32","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1998)"},{"key":"919_CR33","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/59.317549","volume":"9","author":"GB Sheble","year":"1994","unstructured":"Sheble, G.B., Fahd, G.N.: Unit commitment literature synopsis. IEEE Trans. Power Syst. 9, 128\u2013135 (1994)","journal-title":"IEEE Trans. Power Syst."},{"issue":"6","key":"919_CR34","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1287\/opre.15.6.985","volume":"15","author":"EA Silver","year":"1967","unstructured":"Silver, E.A.: A tutorial on production smoothing and work force balancing. Oper. Res. 15(6), 985\u20131010 (1967)","journal-title":"Oper. Res."},{"key":"919_CR35","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TPWRS.1987.4335130","volume":"2","author":"WL Snyder","year":"1987","unstructured":"Snyder, W.L., Powell, H.D., Rayburn, J.C.: Dynamic programming approach to unit commitment. IEEE Trans. Power Syst. 2, 339\u2013350 (1987)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR36","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1023\/A:1004653526131","volume":"105","author":"C-L Tseng","year":"2000","unstructured":"Tseng, C.-L., Li, C.A., Oren, S.S.: Solving the unit commitment problem by a unit decommitment method. J. Optim. Theory 105, 707\u2013730 (2000)","journal-title":"J. Optim. Theory"},{"key":"919_CR37","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1109\/TPWRS.2011.2159522","volume":"27","author":"Q Wang","year":"2012","unstructured":"Wang, Q., Guan, Y., Wang, J.: A chance-constrained two-stage stochastic program for unit commitment with uncertain wind power output. IEEE Trans. Power Syst. 27, 206\u2013215 (2012)","journal-title":"IEEE Trans. Power Syst."},{"key":"919_CR38","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1109\/59.49122","volume":"5","author":"F Zhuang","year":"1990","unstructured":"Zhuang, F., Galiana, F.D.: Unit commitment by simulated annealing. IEEE Trans. Power Syst. 5, 311\u2013318 (1990)","journal-title":"IEEE Trans. Power Syst."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0919-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-015-0919-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-015-0919-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,26]],"date-time":"2019-08-26T18:39:08Z","timestamp":1566844748000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-015-0919-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,12]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["919"],"URL":"https:\/\/doi.org\/10.1007\/s10107-015-0919-9","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,12]]}}}