MétaCan
Menu
Back to cohort
Record W4226363315 · doi:10.23952/jano.4.2022.1.05

A new class of vector optimization problems with linear fractional objective criteria

2022· article· en· W4226363315 on OpenAlex
Nguyễn Thị Thu Hương, N. Yen

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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal of Applied and Numerical Optimization · 2022
Typearticle
Languageen
FieldComputer Science
TopicOptimization and Variational Analysis
Canadian institutionsnot available
FundersVietnam Institute for Advanced Study in MathematicsLe Quy Don Technical UniversityVietnam Academy of Science and Technology
KeywordsClass (philosophy)MathematicsVector optimizationMathematical optimizationOptimization problemComputer scienceApplied mathematicsArtificial intelligenceMulti-swarm optimization

Abstract

fetched live from OpenAlex

This paper studies a new class of vector optimization problems where the objective criteria are linear fractional functions, the ordering cone can be any nonempty closed convex pointed and solid cone, and the constraint set can be any nonempty closed convex set. Necessary optimality conditions, as well as sufficient optimality conditions, are obtained. In addition, two theorems on the connectedness of the weakly efficient solution set and the efficient solution set are established. The results are analyzed by concrete examples.

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: Methods
Teacher disagreement score0.265
Threshold uncertainty score0.410

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.001
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.008
GPT teacher head0.225
Teacher spread0.217 · 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