The DOI matches its Crossref record.
Towards a more rigorous and practical unit commitment by Lagrangian relaxation
Abstract
A Lagrangian relaxation algorithm for power system generator unit commitment is proposed. The algorithm proceeds in three phases. In the first phase, the Lagrangian dual of the unit commitment is maximized by standard subgradient techniques. The second phase finds a reserve-feasible dual solution, followed by a third phase of economic dispatch. A mathematically based, systematic and generally applicable procedure to search for a reserve-feasible dual solution is presented. The algorithm has been tested on systems of up to 100 units to be scheduled over 168 hours, giving reliable performance and low execution times. Both spinning and time-limited reserve constraints are treated.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Optimal response of a thermal unit to an electricity spot market
Arroyo, J. M., & Conejo, A. J. (2000) · IEEE Transactions on Power Systems · doi:10.1109/59.871739 · Cited by 536
Metadata
- Authors
- Zhuang, F., & Galiana, F. D.
- Venue
- IEEE Transactions on Power Systems
- Published
- 1988-05
- Volume
- 3
- Issue
- 2
- Pages
- 763-773
- ISSN
- 0885-8950 (ISSN-L)
- OpenAlex
- W1992390555
- Cited by
- 453
- References
- 0
- FWCI
- 3.38
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Towards a more rigorous and practical unit commitment by Lagrangian relaxation. https://app.cochat.ai/papers/10.1109/59.192933
- The paper
- Zhuang, F., & Galiana, F. D. (1988). Towards a more rigorous and practical unit commitment by Lagrangian relaxation. IEEE Transactions on Power Systems. https://doi.org/10.1109/59.192933
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
