Min-up/min-down polytopes
From MaRDI portal
Publication:2386215
DOI10.1016/j.disopt.2003.12.001zbMath1087.90053OpenAlexW1973392070MaRDI QIDQ2386215
Janny M. Y. Leung, Jon Lee, Margot, François
Publication date: 22 August 2005
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2003.12.001
Cutting planeSeparationMixed integer programmingFacetUnit commitmentCross polytopeGeneralized octahedronPower generation
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, The min-up/min-down unit commitment polytope, Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach, A polyhedral study of production ramping, A Polyhedral Study on Fuel-Constrained Unit Commitment, Exploiting complete linear descriptions for decentralized power market problems with integralities, A deterministic method for the unit commitment problem in power systems, 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, The Lagrangian relaxation for the combinatorial integral approximation problem, Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings, Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints, The polytope of binary sequences with bounded variation, Polytopal balls arising in optimization, Bounded variation in binary sequences, Mixed integer linear models for the optimization of dynamical transport networks, Combinatorial integral approximation, The Ramping Polytope and Cut Generation for the Unit Commitment Problem, On Mixed-Integer Programming Formulations for the Unit Commitment Problem, Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints, Mixed-integer optimal control under minimum dwell time constraints, Extended formulations from communication protocols in output-efficient time, Tight MIP formulations of the power-based unit commitment problem, On Vertices and Facets of Combinatorial 2-Level Polytopes, Multistage Stochastic Power Generation Scheduling Co-Optimizing Energy and Ancillary Services, Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
Cites Work
