MétaCan
Menu
Back to cohort
Record W4387956512 · doi:10.18280/mmep.100511

Optimal Solution for Fully Spherical Fuzzy Linear Programming Problem

2023· article· en· W4387956512 on OpenAlexvenueno aff
Yuvashri Prakash, Saraswathi Appasamy

Bibliographic record

VenueMathematical Modelling and Engineering Problems · 2023
Typearticle
Languageen
FieldEngineering
TopicOptimization and Packing Problems
Canadian institutionsnot available
Fundersnot available
KeywordsLinear programmingMathematical optimizationFuzzy logicMathematicsComputer scienceArtificial intelligence

Abstract

fetched live from OpenAlex

This study presents an innovative extension to existing fuzzy set models, introducing the concept of spherical fuzzy sets.Distinguished by their three function characteristics-positive, neutral, and negative membership degrees-the sum of their squares is constrained to be no more than one.This paper discusses the application of these sets through the lens of fully fuzzy spherical linear programming problems, where spherical fuzzy numbers are utilized as parameters.A crisp version of the Spherical Fuzzy Linear Programming Problem (SFLPP) is generated by leveraging these membership degrees.A novel method is proposed for the de-fuzzification of spherical fuzzy numbers into crisp interval numbers.Further, the Best Worst Method (BWM) is employed to solve the crisp Linear Programming Problem (LPP).Alongside this, we propose a spherical fuzzy optimization model to resolve the SFLPP.The validity and optimality of our proposed methodology are substantiated with a detailed numerical example.

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 imitation

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

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0040.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.030
GPT teacher head0.228
Teacher spread0.198 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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

Quick stats

Citations3
Published2023
Admission routes1
Has abstractyes

Explore more

Same venueMathematical Modelling and Engineering ProblemsSame topicOptimization and Packing ProblemsFrench-language works237,207