MétaCan
Menu
Back to cohort
Record W2011998464 · doi:10.1002/aic.13708

Decomposition strategy for the global optimization of flexible energy polygeneration systems

2011· article· en· W2011998464 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueAIChE Journal · 2011
Typearticle
Languageen
FieldEngineering
TopicProcess Optimization and Integration
Canadian institutionsMcMaster University
Fundersnot available
KeywordsDecompositionMathematical optimizationConvergence (economics)Optimization problemGlobal optimizationDuality (order theory)Nonlinear systemComputer scienceDual (grammatical number)Scale (ratio)MathematicsChemistry

Abstract

fetched live from OpenAlex

Abstract The optimal design and operation of flexible energy polygeneration systems using coal and biomass to coproduce power, liquid fuels, and chemicals are investigated. This problem is formulated as a multiperiod optimization problem, which is a potentially large‐scale nonconvex mixed‐integer nonlinear program (MINLP) and cannot be solved to global optimality by state‐of‐the‐art global optimization solvers, such as BARON, within a reasonable time. A duality‐based decomposition method, which can exploit the special structure of this problem, is applied. In this work, the decomposition method is enhanced by the introduction of additional dual information for faster convergence. The enhanced decomposition algorithm (EDA) guarantees to find an ε‐optimal solution in a finite time. The case study results show that the EDA achieves much faster convergence than both BARON and the original decomposition algorithm, and it solved the large‐scale nonconvex MINLPs to ε‐optimality in practical times. © 2011 American Institute of Chemical Engineers AIChE J, 58: 3080–3095, 2012

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.989
Threshold uncertainty score0.221

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.033
GPT teacher head0.260
Teacher spread0.227 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it