Lagrangian relaxation method for price-based unit commitment problem

Takayuki Shiina, Isamu Watanabe

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The unit commitment problem consists of determining the schedules for power generating units and the generating level of each unit. The decisions concern which units to commit during each time period and at what level to generate power to meet the electricity demand. The problem is a typical scheduling problem in an electric power system. The electric power industry is undergoing restructuring and deregulation. This article developes a stochastic programming model which incorporates power trading. The uncertainty of electric power demand or electricity price are incorporated into the unit commitment problem. It is assumed that demand and price uncertainty can be represented by a scenario tree. A stochastic integer programming model is proposed in which the objective is to maximize expected profits. In this model, on/off decisions for each generator are made in the first stage. The approach to solving the problem is based on Lagrangian relaxation and dynamic programming.

Original languageEnglish
Pages (from-to)705-719
Number of pages15
JournalEngineering Optimization
Volume36
Issue number6
DOIs
Publication statusPublished - 2004 Dec 1

    Fingerprint

Keywords

  • Electric power
  • Lagrangian relaxation
  • Stochastic programming
  • Unit commitment

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Optimization
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this