Author: Wong, Po-wah
Title: Unit commitment by the lagrangian relaxation method
Degree: M.Sc.
Year: 1994
Subject: Mathematical optimization -- Case studies
Multipliers (Mathematical analysis)
Lagrangian functions
Hong Kong Polytechnic -- Dissertations
Department: Multi-disciplinary Studies
Pages: v, 77 p. : ill. ; 30 cm
Language: English
Abstract: A new method based on the decomposition technique of Lagrangian Relaxation is developed in order to solve the unit commitment problem of a real system consisting of thermal, nuclear and pumped storage units. The system has large groups of identical units when compared with the system size, and has many operational constraints that are non-coupling and non-local in nature, including minimum plant on bar, forced pumping and generation, pumped storage operational flexibility requirement, crew constraints, minimum two-shifting of coal-fired units and unit grouping constraint. The major objective is to overcome the difficulty of the conventional Lagrangian Relaxation method in solving such a system, namely, simultaneous commitment of identical units and the inability to handle those non-coupling and non-local constraints. The proposed method consists of two phases of sequential commitment for the thermal units. The first phase produces a preliminary thermal unit commitment solution based on the assumption that there is no pumped storage operation. Then using the solution as the basis, the pumped storage units are scheduled optimally, taking into account the pumped storage related non-coupling and non-local constraints. On completion, the pumped storage capacity and generation contributions are deducted from the system requirements and the final solution is obtained after the second phase of sequential commitment. In each phase of sequential commitment, units are sequentially scheduled and system capacity requirement not yet met is considered whenever each unit is scheduled. This solves the problem of simultaneous commitment for identical units. The thermal unit related non-coupling and non-local constraints are handled through specially designed scheduling orders. The convergence rate of the solution process is improved by new updating algorithms for the Lagrange multipliers.
Rights: All rights reserved
Access: restricted access

Files in This Item:
File Description SizeFormat 
b11616556.pdfFor All Users (off-campus access for PolyU Staff & Students only)2.55 MBAdobe PDFView/Open


Copyright Undertaking

As a bona fide Library user, I declare that:

  1. I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
  2. I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
  3. I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.

By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.

Show full item record

Please use this identifier to cite or link to this item: https://theses.lib.polyu.edu.hk/handle/200/4857