Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints

DOI10.1287/opre.1060.0309zbMath1167.90671WikidataQ118165498 ScholiaQ118165498MaRDI QIDQ3392019

Antonio Frangioni, Claudio Gentile

Publication date: 13 August 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.1060.0309

Mathematics Subject Classification ID

90C39: Dynamic programming

Related Items

Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs, A Polyhedral Study on Fuel-Constrained Unit Commitment, Optimal Power Flow in Distribution Networks Under N – 1 Disruptions: A Multistage Stochastic Programming Approach, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Quadratic Convex Reformulations for Semicontinuous Quadratic Programming, Decomposition algorithm for large-scale two-stage unit-commitment, A polyhedral study of production ramping, Unit commitment in oligopolistic markets by nonlinear mixed variable programming, A hybrid biased random key genetic algorithm approach for the unit commitment problem, Decomposition approaches for block-structured chance-constrained programs with application to hydro-thermal unit commitment, Divide to conquer: decomposition methods for energy optimization, Tight MIP formulations of the power-based unit commitment problem, Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, An improved Lagrangian relaxation algorithm for the robust generation self-scheduling problem, Large-scale unit commitment under uncertainty: an updated literature survey, On the complexity of the unit commitment problem, Heuristic solutions to the long-term unit commitment problem with cogeneration plants, Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints, Distributionally robust optimization with multiple time scales: valuation of a thermal power plant, Bundle methods for sum-functions with ``easy components: applications to multicommodity network design, Large-scale unit commitment under uncertainty, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints, Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming, Compact integer linear programming formulations for the temporal bin packing problem with fire-ups, On Minimal Valid Inequalities for Mixed Integer Conic Programs