A polyhedral study of production ramping
DOI10.1007/S10107-015-0919-9zbMATH Open1346.90627OpenAlexW600957409MaRDI QIDQ304233FDOQ304233
Authors: Pelin Damcı-Kurt, Simge Küçükyavuz, Deepak Rajan, Alper Atamtürk 
Publication date: 25 August 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://www.osti.gov/biblio/1455405
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
convex hullpolytopecomputationfacetsvalid inequalitiesco-generationproduction smoothingrampingunit commitment
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)
Cites Work
- A cutting plane approach to capacitated lot-sizing with start-up costs
- Title not available (Why is that?)
- Production Planning by Mixed Integer Programming
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Title not available (Why is that?)
- Solving the unit commitment problem by a unit decommitment method
- Lotsizing with backlogging and start-ups: The case of Wagner-Whitin costs
- Min-up/min-down polytopes
- Lower bounds in lot-sizing models: A polyhedral study
- Production Smoothing with Fluctuating Price
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (26)
- Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
- Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
- An adaptive model with joint chance constraints for a hybrid wind-conventional generator system
- A combined variable aggregation presolving technique for mixed integer programming
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups
- Modeling flexible generator operating regions via chance-constrained stochastic unit commitment
- Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services
- The min-up/min-down unit commitment polytope
- Cutting planes for the multistage stochastic unit commitment problem
- Generalized spherical functions on reductive 𝑝-adic groups
- Asynchronous Lagrangian scenario decomposition
- The polytope of binary sequences with bounded variation
- Lifted polymatroid inequalities for mean-risk optimization with indicator variables
- A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment
- Bounded variation in binary sequences
- On Mixed-Integer Programming Formulations for the Unit Commitment Problem
- Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
- A Polyhedral Study on Fuel-Constrained Unit Commitment
- Tight MIP formulations of the power-based unit commitment problem
- The Ramping Polytope and Cut Generation for the Unit Commitment Problem
- Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
- Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches
- Min-up/min-down polytopes
- A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
- Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
- A strengthened mixed-integer linear programming formulation for combined-cycle units
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)
