On Mixed-Integer Programming Formulations for the Unit Commitment Problem

DOI10.1287/IJOC.2019.0944MaRDI QIDQ5148170zbMATH OpenOpenAlexFDO

Authors Bernard Knueven, James P. Ostrowski, Jean-Paul Watson

Publication date 1 February 2021

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://www.osti.gov/biblio/1670724

zbMATH Keywords

mathematical programming formulationsmixed integer programmingunit commitment

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
• Tight MIP formulations of the power-based unit commitment problem
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Tighter MIP formulations for the discretised unit commitment problem with MIN-stop ramping constraints

Cites work

• A polyhedral study of production ramping
• A tight MIP formulation of the unit commitment problem with start-up and shut-down constraints
• Locally ideal formulations for piecewise linear functions with indicator variables
• Min-up/min-down polytopes
• Modified orbital branching for structured symmetry with an application to unit commitment
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Pyomo -- optimization modeling in Python
• Stochastic Lagrangian relaxation applied to power scheduling in a hydro-thermal system under uncertainty
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• The summed start-up costs in a unit commitment problem
• Tight MIP formulations for bounded up/down times and interval-dependent start-ups

Cited in

(21)

• Operations research in optimal power flow: a guide to recent and emerging methodologies and applications
• Stochastic Lipschitz dynamic programming
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Affine decision rule approximation to address demand response uncertainty in smart grids' capacity planning
• Optimal unit commitment by branch-and-bound exploiting dual optimization conditions
• A deterministic method for the unit commitment problem in power systems
• Learning to Solve Large-Scale Security-Constrained Unit Commitment Problems
• A Polyhedral Study on Fuel-Constrained Unit Commitment
• The Ramping Polytope and Cut Generation for the Unit Commitment Problem
• Optimal Control Formulations for the Unit Commitment Problem
• A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty
• On the Structure of Decision Diagram–Representable Mixed-Integer Programs with Application to Unit Commitment
• A combined variable aggregation presolving technique for mixed integer programming
• Optimal mitigation and control over power system dynamics for stochastic grid resilience
• A quantum computing approach for the unit commitment problem
• Comparing the solvers for the mixed integer linear programming problems and the software environments that call them
• New mixed-integer nonlinear programming formulations for the unit commitment problems with ramping constraints
• (Near)-optimal algorithms for sparse separable convex integer programs
• Maximum number of power unit state changes in selecting the composition of equipment
• Enhancing matheuristics for a thermal unit commitment problem through kernel search and local branching
• An efficient two-stage column generation algorithm for solving large-scale unit commitment

Describes a project that uses

Uses Software

• Gurobi
• CPLEX
• Pyomo
• pglib-uc

This page was built for publication: On Mixed-Integer Programming Formulations for the Unit Commitment Problem

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