Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services

DOI10.1287/ijoc.2019.0933zbMath1466.90037OpenAlexW3048867140MaRDI QIDQ4995076

Yongpei Guan, Kai Pan, Jianqiu Huang

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2019.0933

zbMATH Keywords

stochastic optimizationconvex hullancillary servicesstrong valid inequalitiespower generation scheduling

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic scheduling theory in operations research (90B36)

Related Items (3)

A Polyhedral Study on Fuel-Constrained Unit Commitment ⋮ A generalised approach for efficient computation of look ahead security constrained optimal power flow ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

Cites Work

• Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs
• Decomposition algorithms for two-stage chance-constrained programs
• A polyhedral study of production ramping
• A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
• An integer programming approach for linear programs with probabilistic constraints
• Progressive hedging and tabu search applied to mixed integer (0,1) multistage stochastic programming
• The min-up/min-down unit commitment polytope
• A finite branch-and-bound algorithm for two-stage stochastic integer programs
• A simple recourse model for power dispatch under uncertain demand
• Min-up/min-down polytopes
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Stochastic dual dynamic integer programming
• A decomposition approach to the two-stage stochastic unit commitment problem
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
• A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
• Multiarea Stochastic Unit Commitment for High Wind Penetration in a Transmission Constrained Network
• Strong Formulations for Multistage Stochastic Self-Scheduling Unit Commitment
• Introduction to Stochastic Programming
• The Value of Multistage Stochastic Programming in Capacity Planning Under Uncertainty
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• A Stochastic Programming Approach to Power Portfolio Optimization
• Algorithm for the N-2 Security-Constrained Unit Commitment Problem with Transmission Switching
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Stochastic Power Generation Unit Commitment in Electricity Markets: A Novel Formulation and a Comparison of Solution Methods
• Cutting Planes for Multistage Stochastic Integer Programs
• Approximate Dynamic Programming
• Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty

This page was built for publication: Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services