Feasible solution criterion of power generation optimal scheduling and its solution

Lei Wu, Qiao Zhu Zhai, Xiao Hong Guan

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

Power generation optimal scheduling is a classical complex mixed integer programming problem. Although Lagrangian relaxation is one of the most successful method, the obtained schedules in the dual solution by Lagrangian relaxation are generally infeasible for original problem, to obtain feasible solution firstly a feasible commitment should be achieved, on this basis only by adjusting the outputs of the units being operated all of the systematic constraints can be satisfied. Here, at first the problems in existing feasible conditions are analyzed and a feasible condition which is easy to examine is put forward and it is proved that this condition is necessary and sufficient, then the systematic approach to obtain feasible solution is presented.

Original languageEnglish
Pages (from-to)1-4
Number of pages4
JournalPower System Technology
Volume28
Issue number1
StatePublished - 5 Jan 2004

Keywords

  • Feasible schedule criterion
  • Power generation scheduling
  • Unit commitment

Fingerprint

Dive into the research topics of 'Feasible solution criterion of power generation optimal scheduling and its solution'. Together they form a unique fingerprint.

Cite this