Optimization Online


A Novel Matching Formulation for Startup Costs in Unit Commitment

Ben Knueven (bknueven***at***vols.utk.edu)
Jim Ostrowski (jostrows***at***utk.edu)
Jean-Paul Watson (jwatson***at***sandia.gov)

Abstract: We present a novel formulation for startup cost computation in the unit commitment problem (UC). Both the proposed formulation and existing formulations in the literature are placed in a formal, theoretical dominance hierarchy based on their respective linear programming relaxations. The proposed formulation is tested empirically against existing formulations on large-scale unit commitment instances drawn from real-world data. While requiring more variables than the current state-of-the-art formulation, our proposed formulation requires fewer constraints, and is empirically demonstrated to be as tight as a perfect formulation for startup costs. This tightening reduces the computational burden in comparison to existing formulations, especially for UC instances with large variability in net-load due to renewables production.

Keywords: Unit Commitment, mixed-integer programming, strong lower bounds

Category 1: Applications -- OR and Management Sciences (Scheduling )

Category 2: Integer Programming ((Mixed) Integer Linear Programming )

Citation: Department of Industrial and Systems Engineering University of Tennessee, Knoxville, TN 37996 March 2017

Download: [PDF]

Entry Submitted: 03/10/2017
Entry Accepted: 03/10/2017
Entry Last Modified: 11/18/2018

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society