Approximating Nonlinear Relationships for Optimal Operation of Natural Gas Transport Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The compressor fuel cost minimization problem (FCMP) for natural gas pipelines is a relevant problem because of the substantial energy consumption of compressor stations transporting the large global demand for natural gas. The common method for modeling the FCMP is to assume key modeling parameters such as the friction factor, compressibility factor, isentropic exponent, and compressor efficiency to be constants, and their nonlinear relationships to the system operating conditions are ignored. Previous work has avoided the complexity associated with the nonlinear relationships inherent in the FCMP to avoid unreasonably long solution times for practical transportation systems. In this paper, a mixed-integer linear programming (MILP) based method is introduced to generate piecewise-linear functions that approximate the previously ignored nonlinear relationships. The MILP determines the optimal break-points and orientation of the linear segments so that approximation error is minimized. A novel FCMP model that includes the piecewise-linear approximations is applied in a case study on three simple gas networks. The case study shows that the novel FCMP model captures the nonlinear relationships with a high degree of accuracy and only marginally increases solution time compared to the common simplified FCMP model. The common simplified model is found to produce solutions with high error and infeasibility when applied on a rigorous simulation.
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it