Decomposition strategy for the global optimization of flexible energy polygeneration systems
Bibliographic record
Abstract
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.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 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".