Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 163

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Nonlinear Programming Solutions for Load-Flow, Minimum-Loss, and Economic Dispatching Problems

Sasson, Albert·1969·IEEE Transactions on Power Apparatus and Systems

Abstract

A unified approach to load-flow, minimum-loss, and economic dispatching problems is presented. A load-flow solution is shown to coincide with the minimum of a function of the power system equations. An unconstrained minimization method, developed by Fletcher-Powell, is used to solve the load-flow problem. The method always finds a solution or indicates the nonexistence of a solution. Its performance is highly independent of the reference- slack bus position and requires no acceleration factors. Several constrained minimization techniques that solve the minimum-loss and economic dispatching problems are investigated. These include the Fiacco-McCormick, Lootsma, and Zangwill methods. The technique finally recommended is shown to be an extension of the method used to solve the load-flow problem. The approved IEEE test systems, and other systems whose response to conventional methods was known, have been solved.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/tpas.1969.292460

Cites

1 of 1 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

See all 163

Metadata

Authors
Sasson, A.
Venue
IEEE Transactions on Power Apparatus and Systems
Published
1969-04
Volume
PAS-88
Issue
4
Pages
399-409
ISSN
0018-9510 (ISSN-L)
OpenAlex
W2006714361
Cited by
163
References
1
FWCI
9.66
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: Nonlinear Programming Solutions for Load-Flow, Minimum-Loss, and Economic Dispatching Problems. https://app.cochat.ai/papers/10.1109/tpas.1969.292460
The paper
Sasson, A. (1969). Nonlinear Programming Solutions for Load-Flow, Minimum-Loss, and Economic Dispatching Problems. IEEE Transactions on Power Apparatus and Systems. https://doi.org/10.1109/tpas.1969.292460

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.