A polyhedral study of production ramping
From MaRDI portal
Publication:304233
DOI10.1007/s10107-015-0919-9zbMath1346.90627MaRDI QIDQ304233
Deepak Rajan, Simge Küçükyavuz, Pelin Damcı-Kurt, Atamtürk, Alper
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
polytope; convex hull; valid inequalities; facets; computation; unit commitment; co-generation; production smoothing; ramping
Related Items
Generalized spherical functions on reductive 𝑝-adic groups, Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems, A Polyhedral Study on Fuel-Constrained Unit Commitment, Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, The polytope of binary sequences with bounded variation, Bounded variation in binary sequences, Cutting planes for the multistage stochastic unit commitment problem, 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, A strengthened mixed-integer linear programming formulation for combined-cycle units, A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment, An adaptive model with joint chance constraints for a hybrid wind-conventional generator system, Operations research in optimal power flow: a guide to recent and emerging methodologies and applications, Modeling flexible generator operating regions via chance-constrained stochastic unit commitment, Asynchronous Lagrangian scenario decomposition, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints, A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints, Lifted polymatroid inequalities for mean-risk optimization with indicator variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A strong conic quadratic reformulation for machine-job assignment with controllable processing times
- A cutting plane approach to capacitated lot-sizing with start-up costs
- 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
- Solving Nonlinear Single-Unit Commitment Problems with Ramping Constraints
- Production Smoothing with Fluctuating Price
- Production Planning by Mixed Integer Programming
