On Mixed-Integer Programming Formulations for the Unit Commitment Problem

DOI10.1287/ijoc.2019.0944OpenAlexW3037143235MaRDI QIDQ5148170

Jean-Paul Watson, Bernard Knueven, James Ostrowski

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

mixed integer programmingunit commitmentmathematical programming formulations

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (5)

A Polyhedral Study on Fuel-Constrained Unit Commitment ⋮ Affine decision rule approximation to address demand response uncertainty in smart grids' capacity planning ⋮ A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty ⋮ Operations research in optimal power flow: a guide to recent and emerging methodologies and applications ⋮ Stochastic Lipschitz dynamic programming

Uses Software

• CPLEX
• Gurobi
• Pyomo
• pglib-uc

Cites Work

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

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