Help
Cart
Skip main navigation

Available Issues

April 16, 2013 - May 25, 2026

Available Issues

April 16, 2013 - May 25, 2026

On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment

Published Online:4 Aug 2022https://doi.org/10.1287/opre.2022.2353

References

  • Atakan S, Lulli G, Sen S (2017) A state transition MIP formulation for the unit commitment problem. IEEE Trans. Power Systems 33(1):736–748.Crossref, Google Scholar
  • Baldick R (1995) The generalized unit commitment problem. IEEE Trans. Power Systems 10(1):465–475.Crossref, Google Scholar
  • Bendotti P, Fouilhoux P, Rottner C (2018) The min-up/min-down unit commitment polytope. J. Combin. Optim. 36(3):1024–1058.Crossref, Google Scholar
  • Bendotti P, Fouilhoux P, Rottner C (2019) On the complexity of the unit commitment problem. Ann. Oper. Res. 274(1–2):119–130.Crossref, Google Scholar
  • Bergman D, Cire AA (2016) Multiobjective optimization by decision diagrams. Internat. Conf. Principles Practice Constraint Programming (Springer), 86–95.Google Scholar
  • Bergman D, Cire AA (2018) Discrete nonlinear optimization by state-space decompositions. Management Sci. 64(10):4700–4720.Link, Google Scholar
  • Bergman D, Cire AA, van Hoeve WJ (2015) Lagrangian bounds from decision diagrams. Constraints 20(3):346–361.Crossref, Google Scholar
  • Bergman D, Cire AA, van Hoeve WJ, Hooker J (2016) Decision Diagrams for Optimization (Springer International Publishing, Cham, Switzerland).Crossref, Google Scholar
  • Bertsimas D, Litvinov E, Sun XA, Zhao J, Zheng T (2012) Adaptive robust optimization for the security constrained unit commitment problem. IEEE Trans. Power Systems 28(1):52–63.Crossref, Google Scholar
  • Blanco I, Morales JM (2017) An efficient robust solution to the two-stage stochastic unit commitment problem. IEEE Trans. Power Systems 32(6):4477–4488.Crossref, Google Scholar
  • Bonami P, Salvagnin D, Tramontani A (2020) Implementing automatic Benders decomposition in a modern MIP solver. Internat. Conf. Integer Programming Combin. Optim. (Springer), 78–90.Google Scholar
  • Carrión M, Arroyo JM (2006) A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Systems 21(3):1371–1378.Crossref, Google Scholar
  • Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
  • Conforti M, Cornuéjols G, Zambelli G (2014) Integer Programming, vol. 271 (Springer International Publishing, Cham, Switzerland).Crossref, Google Scholar
  • Davarnia D (2021) Strong relaxations for continuous nonlinear programs based on decision diagrams. Oper. Res. Lett. 49(2):239–245.Google Scholar
  • Davarnia D, van Hoeve WJ (2020) Outer approximation for integer nonlinear programs via decision diagrams. Math. Programming 187:111–150.Google Scholar
  • Feng Y, Ryan SM (2016) Solution sensitivity-based scenario reduction for stochastic unit commitment. Comput. Management Sci. 13(1):29–62.Crossref, Google Scholar
  • Fischetti M, Salvagnin D, Zanette A (2010) A note on the selection of Benders’ cuts. Math. Programming 124(1):175–182.Crossref, Google Scholar
  • Frangioni A, Gentile C (2006) Solving nonlinear single-unit commitment problems with ramping constraints. Oper. Res. 54(4):767–775.Link, Google Scholar
  • Frangioni A, Gentile C, Lacalandra F (2008) Tighter approximated MILP formulations for unit commitment problems. IEEE Trans. Power Systems 24(1):105–113.Crossref, Google Scholar
  • Franz A, Rieck J, Zimmermann J (2020) A long-term unit commitment problem with hydrothermal coordination for economic and emission control in large-scale electricity systems. OR Spectrum 42(1):235–259.Crossref, Google Scholar
  • Fu Y, Li Z, Wu L (2013) Modeling and solution of the large-scale security-constrained unit commitment. IEEE Trans. Power Systems 28(4):3524–3533.Crossref, Google Scholar
  • Garver LL (1962) Power generation scheduling by integer programming—Development of theory. Trans. Amer. Inst. Electr. Engineers Part III Power Apparatus Systems 81(3):730–734.Crossref, Google Scholar
  • Gonzalez J, Cire A, Lodi A, Rousseau LM (2020) Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints 25:23–46.Crossref, Google Scholar
  • Guan X, Zhai Q, Papalexopoulos A (2003) Optimization based methods for unit commitment: Lagrangian relaxation vs. general mixed integer programming. 2003 IEEE Power Engineering Soc. General Meeting, vol. 2 (IEEE), 1095–1100.Google Scholar
  • Hadzić T, Hooker JN (2006) Discrete global optimization with binary decision diagrams. Workshop Global Optim. Integrating Convexity Optim. Logic Programming Comput. Algebraic Geometry.Google Scholar
  • Huang Y, Pardalos PM, Zheng QP (2017) Electrical Power Unit Commitment: Deterministic and Two-Stage Stochastic Programming Models and Algorithms (Springer, New York).Crossref, Google Scholar
  • Knueven B, Ostrowski J, Watson JP (2020a) A novel matching formulation for startup costs in unit commitment. Math. Programming Comput. 12:225–248.Crossref, Google Scholar
  • Knueven B, Ostrowski J, Watson JP (2020b) On mixed-integer programming formulations for the unit commitment problem. INFORMS J. Comput. 32(4):857–876.Abstract, Google Scholar
  • Lee FN, Feng Q (1992) Multi-area unit commitment. IEEE Trans. Power Systems 7(2):591–599.Crossref, Google Scholar
  • Li T, Shahidehpour M (2005) Price-based unit commitment: A case of Lagrangian relaxation vs. mixed integer programming. IEEE Trans. Power Systems 20(4):2015–2025.Crossref, Google Scholar
  • Li Y, McCalley JD, Ryan S (2007) Risk-based unit commitment. 2007 IEEE Power Engineering Soc. General Meeting (IEEE), 1–7.Google Scholar
  • Lorca Á, Sun XA, Litvinov E, Zheng T (2016) Multistage adaptive robust optimization for the unit commitment problem. Oper. Res. 64(1):32–51.Link, Google Scholar
  • Maifeld TT, Sheble GB (1996) Genetic-based unit commitment algorithm. IEEE Trans. Power Systems 11(3):1359–1370.Crossref, Google Scholar
  • Mantawy A, Abdel-Magid YL, Selim SZ (1998) A simulated annealing algorithm for unit commitment. IEEE Trans. Power Systems 13(1):197–204.Crossref, Google Scholar
  • Morales-España G, Latorre JM, Ramos A (2013) Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans. Power Systems 28(4):4897–4908.Crossref, Google Scholar
  • Nemhauser GL, Wolsey LA (1990) A recursive procedure to generate all cuts for 0–1 mixed integer programs. Math. Programming 46(1–3):379–390.Crossref, Google Scholar
  • Ostrowski J, Anjos MF, Vannelli A (2011) Tight mixed integer linear programming formulations for the unit commitment problem. IEEE Trans. Power Systems 27(1):39–46.Crossref, Google Scholar
  • Padhy NP (2004) Unit commitment—A bibliographical survey. IEEE Trans. Power Systems 19(2):1196–1205.Crossref, Google Scholar
  • Pang C, Sheblé GB, Albuyeh F (1981) Evaluation of dynamic programming based methods and multiple area representation for thermal unit commitments. IEEE Trans. Power Apparatus Systems 100(3):1212–1218.Crossref, Google Scholar
  • Queyranne M, Wolsey LA (2017) Tight MIP formulations for bounded up/down times and interval-dependent start-ups. Math. Programming 164(1–2):129–155.Crossref, Google Scholar
  • Rajan D, Takriti S (2005) Minimum up/down polytopes of the unit commitment problem with start-up costs. IBM Research Report 23628.Google Scholar
  • Rajan CA, Mohan M, Manivannan K (2003) Neural-based tabu search method for solving unit commitment problem. IEE Proc. Generation Transmission Distribution 150(4):469–474.Crossref, Google Scholar
  • Rockafeller RT (1970) Convex Analysis (Princeton University Press, Princeton, NJ).Crossref, Google Scholar
  • Rodríguez JA, Anjos MF, Côté P, Desaulniers G (2021) Accelerating Benders decomposition for short-term hydropower maintenance scheduling. Eur. J. Oper. Res. 289(1):240–253.Crossref, Google Scholar
  • Saneifard S, Prasad NR, Smolleck HA (1997) A fuzzy logic approach to unit commitment. IEEE Trans. Power Systems 12(2):988–995.Crossref, Google Scholar
  • Serra T, Hooker J (2020) Compact representation of near-optimal integer programming solutions. Math. Programming 182:199–232.Crossref, Google Scholar
  • Silbernagl M, Huber M, Brandenberg R (2015) Improving accuracy and efficiency of start-up cost formulations in MIP unit commitment by modeling power plant temperatures. IEEE Trans. Power Systems 31(4):2578–2586.Crossref, Google Scholar
  • Tuffaha M, Gravdahl JT (2013) Mixed-integer formulation of unit commitment problem for power systems: Focus on start-up cost. 39th Annual Conf. IEEE Indust. Electronics Soc. (IEEE), 8160–8165.Google Scholar
  • van Ackooij W, Danti Lopez I, Frangioni A, Lacalandra F, Tahanan M (2018) Large-scale unit commitment under uncertainty: An updated literature survey. Ann. Oper. Res. 271(1):11–85.Crossref, Google Scholar
  • van der Linden K (2017) Decision diagrams for decomposed mixed integer linear programs. Unpublished master’s thesis. Delft University of Technology, Netherlands.Google Scholar
  • Wu L (2011) A tighter piecewise linear approximation of quadratic cost curves for unit commitment problems. IEEE Trans. Power Systems 26(4):2581–2583.Crossref, Google Scholar
  • Xavier AS, Kazachkov AM, Qiu F (2020) Unitcommitment.jl: A julia/jump optimization package for security-constrained unit commitment. Zenodo.Google Scholar
  • Zheng QP, Wang J, Liu AL (2014) Stochastic optimization for unit commitment—A review. IEEE Trans. Power Systems 30(4):1913–1924.Crossref, Google Scholar
  • Zheng QP, Wang J, Pardalos PM, Guan Y (2013) A decomposition approach to the two-stage stochastic unit commitment problem. Ann. Oper. Res. 210(1):387–410.Crossref, Google Scholar
Previous
Back to Top
Next
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.
Agree