A polyhedral study of production ramping

DOI10.1007/s10107-015-0919-9zbMath1346.90627OpenAlexW600957409MaRDI 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

zbMATH Keywords

polytopeconvex hullvalid inequalitiesfacetscomputationunit commitmentco-generationproduction smoothingramping

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches, Tight MIP formulations for bounded up/down times and interval-dependent start-ups, Cutting planes for the multistage stochastic unit commitment problem, A Polyhedral Study on Fuel-Constrained Unit Commitment, 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, Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, The polytope of binary sequences with bounded variation, Lifted polymatroid inequalities for mean-risk optimization with indicator variables, Bounded variation in binary sequences, A strengthened mixed-integer linear programming formulation for combined-cycle units, Modeling flexible generator operating regions via chance-constrained stochastic unit commitment, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, An adaptive model with joint chance constraints for a hybrid wind-conventional generator system, Asynchronous Lagrangian scenario decomposition, Generalized spherical functions on reductive 𝑝-adic groups, A fully distributed asynchronous approach for multi-area coordinated network-constrained unit commitment, Tight MIP formulations of the power-based unit commitment problem, Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems, Operations research in optimal power flow: a guide to recent and emerging methodologies and applications

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item