Recommendations
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- The min-up/min-down unit commitment polytope
- Cutting planes for the multistage stochastic unit commitment problem
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- scientific article; zbMATH DE number 2084779 (Why is no real title available?)
- scientific article; zbMATH DE number 780785 (Why is no real title available?)
- A cutting plane approach to capacitated lot-sizing with start-up costs
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Lower bounds in lot-sizing models: A polyhedral study
- Min-up/min-down polytopes
- Production Planning by Mixed Integer Programming
- Production Smoothing with Fluctuating Price
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Solving the unit commitment problem by a unit decommitment method
Cited in
(28)- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- Tight MIP formulations of the power-based unit commitment problem
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- The polytope of binary sequences with bounded variation
- Cutting planes for the multistage stochastic unit commitment problem
- New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- The min-up/min-down unit commitment polytope
- Asynchronous Lagrangian scenario decomposition
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
- Min-up/min-down polytopes
- Start-up/shut-down MINLP formulations for the unit commitment with ramp constraints
- Generalized spherical functions on reductive 𝑝-adic groups
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- A strengthened mixed-integer linear programming formulation for combined-cycle units
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- A Polyhedral Study on Fuel-Constrained Unit Commitment
- A combined variable aggregation presolving technique for mixed integer programming
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- Modeling flexible generator operating regions via chance-constrained stochastic unit commitment
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
- Bounded variation in binary sequences
This page was built for publication: A polyhedral study of production ramping
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q304233)
