Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Cutting planes for the multistage stochastic unit commitment problem

Journal Article · · Mathematical Programming
 [1];  [2];  [3]
  1. Univ. of Michigan, Ann Arbor, MI (United States)
  2. Univ. of Florida, Gainesville, FL (United States)
  3. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
As renewable energy penetration rates continue to increase in power systems worldwide, new challenges arise for system operators in both regulated and deregulated electricity markets to solve the security-constrained coal-fired unit commitment problem with intermittent generation (due to renewables) and uncertain load, in order to ensure system reliability and maintain cost effectiveness. In this paper, we study a security-constrained coal-fired stochastic unit commitment model, which we use to enhance the reliability unit commitment process for day-ahead power system operations. In our approach, we first develop a deterministic equivalent formulation for the problem, which leads to a large-scale mixed-integer linear program. Then, we verify that the turn on/off inequalities provide a convex hull representation of the minimum-up/down time polytope under the stochastic setting. Next, we develop several families of strong valid inequalities mainly through lifting schemes. In particular, by exploring sequence independent lifting and subadditive approximation lifting properties for the lifting schemes, we obtain strong valid inequalities for the ramping and general load balance polytopes. Lastly, branch-and-cut algorithms are developed to employ these valid inequalities as cutting planes to solve the problem. Our computational results verify the effectiveness of the proposed approach.
Research Organization:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sandia National Laboratories (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA); USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR) (SC-21)
Grant/Contract Number:
AC04-94AL85000
OSTI ID:
1062274
Alternate ID(s):
OSTI ID: 1332947
Report Number(s):
SAND--2012-9093J; SAND--2016-11112J; PII: 971
Journal Information:
Mathematical Programming, Journal Name: Mathematical Programming Journal Issue: 1 Vol. 157; ISSN 0025-5610
Publisher:
SpringerCopyright Statement
Country of Publication:
United States
Language:
English

References (48)

Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming journal January 1996
An algorithm for the construction of convex hulls in simple integer recourse programming journal December 1996
A finite branch-and-bound algorithm for two-stage stochastic integer programs journal June 2004
The C3 Theorem and a D2 Algorithm for Large Scale Stochastic Mixed-Integer Programming: Set Convexification journal April 2005
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem journal March 2005
Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming journal July 2005
Lifting inequalities: a framework for generating strong cuts for nonlinear programs journal May 2008
A polyhedral study of the semi-continuous knapsack problem journal June 2012
Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs journal November 2012
A polyhedral study of production ramping journal June 2015
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited journal May 2007
Household response to dynamic pricing of electricity: a survey of 15 experiments journal August 2010
An optimization-based method for unit commitment journal February 1992
The integer L-shaped method for stochastic integer programs with complete recourse journal April 1993
A scenario decomposition algorithm for 0–1 stochastic programs journal November 2013
Wind Power Forecasting in U.S. Electricity Markets journal April 2010
The complexity of cover inequality separation journal August 1998
Dual decomposition in stochastic integer programming journal February 1999
A transmission-constrained unit commitment method in power system scheduling journal January 1999
Unit commitment literature synopsis journal January 1994
Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation journal January 1995
A stochastic model for the unit commitment problem journal January 1996
Reliability unit commitment in ERCOT conference January 2006
Security-constrained unit commitment with volatile wind power generation conference July 2009
Stochastic Security-Constrained Unit Commitment journal May 2007
Reserve Requirements for Wind Power Integration: A Scenario-Based Stochastic Programming Framework journal November 2011
A Chance-Constrained Two-Stage Stochastic Program for Unit Commitment With Uncertain Wind Power Output journal February 2012
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem journal February 2012
A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems journal June 2004
Valid Inequalities and Superadditivity for 0–1 Integer Programs journal February 1977
Cutting Planes for Multistage Stochastic Integer Programs journal April 2009
Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods journal February 2009
The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty journal August 2009
Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Random Recourse journal February 2010
Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming journal January 1996
An algorithm for the construction of convex hulls in simple integer recourse programming journal December 1996
An optimization-based method for unit commitment journal February 1992
The integer L-shaped method for stochastic integer programs with complete recourse journal April 1993
The complexity of cover inequality separation journal August 1998
Dual decomposition in stochastic integer programming journal February 1999
A transmission-constrained unit commitment method in power system scheduling journal January 1999
Sequence Independent Lifting in Mixed Integer Programming journal January 2000
Reliability unit commitment in ERCOT conference January 2006
Stochastic Security-Constrained Unit Commitment journal May 2007
Security-Constrained Unit Commitment With Volatile Wind Power Generation journal August 2008
Reserve Requirements for Wind Power Integration: A Scenario-Based Stochastic Programming Framework journal November 2011
A Chance-Constrained Two-Stage Stochastic Program for Unit Commitment With Uncertain Wind Power Output journal February 2012
Tight Mixed Integer Linear Programming Formulations for the Unit Commitment Problem journal February 2012

Cited By (3)

Large-scale unit commitment under uncertainty: an updated literature survey journal September 2018
A finite $$\epsilon $$-convergence algorithm for two-stage stochastic convex nonlinear programs with mixed-binary first and second-stage variables journal August 2019
Modeling and Solution Techniques Used for Hydro Generation Scheduling journal July 2019

Similar Records

Strengthened MILP formulation for certain gas turbine unit commitment problems
Journal Article · Thu May 21 20:00:00 EDT 2015 · IEEE Transactions on Power Systems · OSTI ID:1237651

Stochastic Unit Commitment: Model Reduction via Learning
Journal Article · Mon Jul 03 20:00:00 EDT 2023 · Current Sustainable/Renewable Energy Reports · OSTI ID:1988713