Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
From MaRDI portal
Recommendations
- Fast computation of global solutions to the single-period unit commitment problem
- Dynamic unit commitment problem of controlling a power system in a competitive electricity market
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
- Power generation scheduling algorithm using dynamic programming
Cited in
(32)- 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
- Fast computation of global solutions to the single-period unit commitment problem
- 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
- A polynomial-time algorithm with tight error bounds for single-period unit commitment problem
- Decomposition algorithm for large-scale two-stage unit-commitment
- On minimal valid inequalities for mixed integer conic programs
- 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
- 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
- Worst-case analysis of heuristic approaches for the temporal bin packing problem with fire-ups
- Generalized min-up/min-down polytopes
- Divide to conquer: decomposition methods for energy optimization
- Tight MIP formulations of the power-based unit commitment problem
- A variant of the dynamic programming algorithm for unit commitment of combined heat and power systems
This page was built for publication: Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392019)
