Min-up/min-down polytopes

DOI10.1016/J.DISOPT.2003.12.001MaRDI QIDQ2386215zbMATH OpenOpenAlexFDO

Authors Jon Lee, Janny Leung, François Margot

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

zbMATH Keywords

Cutting planeMixed integer programmingFacetSeparationUnit commitmentCross polytopeGeneralized octahedronPower generation

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Recommendations

• The min-up/min-down unit commitment polytope
• A polyhedral study of production ramping
• On the polyhedral structure of a multi-item production planning model with setup times
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• scientific article; zbMATH DE number 1757964

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 1149836 (Why is no real title available?)
• An Application of Lagrangian Relaxation to Scheduling in Power-Generation Systems
• Geometric comparison of combinatorial polytopes
• Lectures on Polytopes

Cited in

(28)

• Parallel matheuristics for the discrete unit commitment problem with min‐stop ramping constraints
• Penalty alternating direction methods for mixed-integer optimal control with combinatorial constraints
• The Lagrangian relaxation for the combinatorial integral approximation problem
• Integrated Stochastic Optimal Self-Scheduling for Two-Settlement Electricity Markets
• Minimal zonotopes containing the crosspolytope
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups
• The min-up/min-down unit commitment polytope
• A polyhedral study of production ramping
• Mixed-integer optimal control under minimum dwell time constraints
• Autonomous traffic at intersections: An optimization‐based analysis of possible time, energy, and CO savings
• Exploiting complete linear descriptions for decentralized power market problems with integralities
• Mixed integer linear models for the optimization of dynamical transport networks
• The polytope of binary sequences with bounded variation
• Bounded variation in binary sequences
• Multistage stochastic power generation scheduling co-optimizing energy and ancillary services
• On Mixed-Integer Programming Formulations for the Unit Commitment Problem
• A deterministic method for the unit commitment problem in power systems
• Parabolic optimal control problems with combinatorial switching constraints. I: Convex relaxations
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints
• Tight MIP formulations of the power-based unit commitment problem
• Combinatorial integral approximation
• A Polyhedral Study on Fuel-Constrained Unit Commitment
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Polytopal balls arising in optimization
• 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
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Weekly self-scheduling, forward contracting, and pool involvement for an electricity producer. An adaptive robust optimization approach

This page was built for publication: Min-up/min-down polytopes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386215)