Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty

DOI10.1287/IJOC.2020.0995MaRDI QIDQ5085475zbMATH OpenOpenAlexFDO

Authors

Publication date 27 June 2022

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

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

zbMATH Keywords

stochastic programmingmixed integer programmingpolyhedral studyBenders decompositionunit commitment

Mathematics Subject Classification ID

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

Recommendations

• Large-scale unit commitment under uncertainty
• Unit commitment under uncertainty in AC transmission systems via risk averse semidefinite stochastic programs
• Cutting planes for the multistage stochastic unit commitment problem
• Large-scale unit commitment under uncertainty: an updated literature survey
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
• Stochastic unit commitment problem
• Chance-Constrained Unit Commitment With N-1 Security and Wind Uncertainty
• Robust Optimization for Power Systems Capacity Expansion under Uncertainty
• MULTIPERIOD OPTIMAL POWER PLANT MIX UNDER DEMAND UNCERTAINTY

Cites work

• scientific article; zbMATH DE number 2121076 (Why is no real title available?)
• scientific article; zbMATH DE number 1416629 (Why is no real title available?)
• A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
• A decomposition approach to the two-stage stochastic unit commitment problem
• A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Accelerating Benders decomposition by local branching
• Accelerating Benders method using covering cut bundle generation
• Cutting planes for multistage stochastic integer programs
• Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
• Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
• Dual decomposition in stochastic integer programming
• Generalized Benders decomposition
• L-shaped decomposition of two-stage stochastic programs with integer recourse
• Large-scale mixed integer programming: Benders-type heuristics
• Multiarea stochastic unit commitment for high wind penetration in a transmission constrained network
• On parallelizing dual decomposition in stochastic integer programming
• Partitioning procedures for solving mixed-variables programming problems
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Stochastic dual dynamic integer programming
• Stochastic unit commitment problem
• The N-k problem in power grids: new models, formulations, and numerical experiments
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse
• The sample average approximation method for stochastic discrete optimization
• Two-stage network constrained robust unit commitment problem

Cited in

(2)

• A Polyhedral Study on Fuel-Constrained Unit Commitment
• Contingency-constrained unit commitment with post-contingency corrective recourse

Describes a project that uses

Uses Software

• pstca

This page was built for publication: Extreme Ray Feasibility Cuts for Unit Commitment with Uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5085475)