Lagrangian relaxation method for price-based unit commitment problem

Lagrangian relaxation method for price-based unit commitment problem

0.00 Avg rating0 Votes
Article ID: iaor20051299
Country: United Kingdom
Volume: 36
Issue: 6
Start Page Number: 705
End Page Number: 719
Publication Date: Dec 2004
Journal: Engineering Optimization
Authors: ,
Keywords: engineering, lagrange multipliers, programming: probabilistic
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 develops 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.

Reviews

Required fields are marked *. Your email address will not be published.