DC Optimal Power Flow of the PJM Five-Bus System Using General Algebraic Modeling System (GAMS)
Bibliographic record
Abstract
This paper presents a practical application of the Direct Current Optimal Power Flow (DC-OPF) model to the PJM 5-bus test system using the General Algebraic Modeling System (GAMS). The study aims to minimize system generation costs while respecting generator capacity, load balancing, and transmission line constraints through utilizing a linear programming approach for computational efficiency, but also ensuring reliability and operational efficiency. Key operational outcomes such as generator dispatch, power flows, and Locational Marginal Prices (LMP) are analyzed, with observed LMPs ranging from $ 10/MWh to $ 40/Wh depending on system congestion. The results highlight the impact of transmission congestion, notably identifying line E-D as the limiting element affecting market prices. Through comparison of AC power flow, the strengths and limitations of DC-OPF is showcased, particularly its inability to model voltage magnitudes and reactive power. The findings highlight the values of DC-OPF for fast market clearing applications while emphasizing the need for AC analyses in certain scenarios that may be sensitive to voltage and reactive power. The study provides actionable information for system operators and researchers engaged in the design and operational planning of the electricity market.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".