MétaCan
Menu
Back to cohort
Record W2065552983 · doi:10.1080/03052150802043681

An interval full-infinite programming method to supporting environmental decision-making

2008· article· en· W2065552983 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

VenueEngineering Optimization · 2008
Typearticle
Languageen
FieldEngineering
TopicWater resources management and optimization
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsInterval (graph theory)Mathematical optimizationSemi-infinite programmingComputer scienceLinear programmingGoal programmingMathematics

Abstract

fetched live from OpenAlex

An interval full-infinite programming (IFIP) method is developed by introducing a concept of functional intervals into an optimization framework. Since the solutions of the problem should be ‘globally’ optimal under all possible levels of the associated impact factors, the number of objectives and constraints is infinite. To solve the IFIP problem, it is converted to two interactive semi-infinite programming (SIP) submodels that can be solved by conventional SIP solution algorithms. The IFIP method is applied to a solid waste management system to illustrate its performance in supporting decision-making. Compared to conventional interval linear programming (ILP) methods, the IFIP is capable of addressing uncertainties arising from not only the imprecise information but also complex relations to external impact factors. Compared to SIP that can only handle problems containing infinite constraints, the IFIP approaches are useful for addressing inexact problems with infinite objectives and constraints.

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.415
Threshold uncertainty score1.000

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.007
GPT teacher head0.230
Teacher spread0.223 · 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