2000
DOI: 10.1109/59.852114
|View full text |Cite
|
Sign up to set email alerts
|

Using integer programming to refine Lagrangian-based unit commitment solutions

Abstract: Ab.Wact-We develop a technique for refining the unit commitment solution obtained from solving the Lagrangian. Our model is an integer program with nonlinear constraints. It can be solved to optimality using branch-and-bound. Numerical results indicate a significant improvement in the quality of the yolution obtained.Indar Terms-Branch-and-hound, dynamic programming, Lagrangian relaxation, mixed-integer programming, unit commitment.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
67
0

Year Published

2003
2003
2018
2018

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 98 publications
(67 citation statements)
references
References 18 publications
0
67
0
Order By: Relevance
“…The minimum up/downtime restrictions ensure that the on/off status of the generators do not change rapidly. Frequent state transitions have several adverse consequences including (i) increased operator stress, (ii) diminished generator life, and (iii) increased emission of pollutants during transient periods (see [25]). Such restrictions are quite practical and are included in many commercial tools.…”
Section: A Formulating the Componentsmentioning
confidence: 99%
See 1 more Smart Citation
“…The minimum up/downtime restrictions ensure that the on/off status of the generators do not change rapidly. Frequent state transitions have several adverse consequences including (i) increased operator stress, (ii) diminished generator life, and (iii) increased emission of pollutants during transient periods (see [25]). Such restrictions are quite practical and are included in many commercial tools.…”
Section: A Formulating the Componentsmentioning
confidence: 99%
“…Such restrictions are quite practical and are included in many commercial tools. To formulate these restrictions, several constraints were proposed in [24], [25], [26]. Following [11], the minimum uptime and downtime constraints are best formulated using the following constraints:…”
Section: A Formulating the Componentsmentioning
confidence: 99%
“…To overcome this issue, in [22] integer programming techniques are developed for refining the UC solution obtained from solving the dual problem, by using the schedules generated by the different iterations of the Lagrangian method.…”
Section: Lagrangian Heuristics For the Uc Of Thermal Unitsmentioning
confidence: 99%
“…Spurred by the progress in the technology of processors and computers, many authors used the MIP formulation for the UC problem for on-land power systems (see e.g. [1], [6], [10], and [4]). In such formulations, a binary variable is used to indicate the status of each generator.…”
Section: Ut Jmentioning
confidence: 99%
“…3) Power generation: The power generated by each generator is bounded from above and below according to manufacturer recommendations, that is, P j ≤ p j (t) ≤ P j , ∀ j ∈ J , ∀t ∈ T . The binary variable u(t) is, usually, included in this inequality, that is to say ( [1], [4], and [6]):…”
Section: A Assumptions and Constraintsmentioning
confidence: 99%