On the application of the branch DistFlow using second-order conic programming in microgrids
Bibliographic record
Abstract
In recent years, the Second-Order Conic Programming (SOCP) model of Distribution Power Flow (DistFlow) has been widely adopted in operation and planning studies of distribution systems due to its simplicity for various applications compared to other convex models. It provides a relaxed convex formulation of DistFlow equations to ensure the feasibility of solutions. This Paper investigates the performance of the SOCP model in Microgrids (MGs) and Active Distribution Systems (ADSs). It identifies scenarios where the SOCP model results in incorrect solutions, implying that it does not necessarily guarantee solution feasibility. Mathematical proofs are also presented to demonstrate that the SOCP DistFlow is not completely capable of maintaining the security of MGs and ADSs. Due to the high popularity of the SOCP model over other DistFlow models in the literature, an effective algorithm is proposed for the SOCP model to ensure the consistency of solutions in MGs and ADSs, regardless of operational conditions. The convergence of the proposed algorithm to the optimal solution is mathematically proved. The results are verified using OpenDSS software. The results demonstrate that the proposed algorithm enhances convergence speed and accuracy, while maintaining the simplicity needed for practical use in operation and planning studies. • Inconsistency of the second-order conic programming model. • Reserve power flow problem in microgrids and active distribution systems. • Proposing mathematical proof for current manipulation. • Remedial algorithm for the second-order conic programming. • Convex and easy-to-use model in different operation and planning problems.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| 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".