{"id":"W4226080534","doi":"10.21203/rs.3.rs-1499946/v1","title":"Mehar approach to solve neutrosophic linear programming problems using possibilistic mean","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Decision maker; Linear programming; Mathematical optimization; Computer science; Mathematics; Operations research","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003332075,0.001105649,0.001777212,0.002356439,0.001194637,0.001831956,0.002042448,0.002131553,0.005668846],"category_scores_gemma":[0.004649521,0.0007661431,0.002640584,0.001905112,0.001225483,0.002048488,0.002452477,0.003708838,0.000553001],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001624161,"about_ca_system_score_gemma":0.001729808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002807175,"about_ca_topic_score_gemma":0.003269933,"domain_scores_codex":[0.9979907,0.000861372,0.0001083935,0.0003192318,0.0005737898,0.0001465206],"domain_scores_gemma":[0.9978476,0.001644017,0.00007390309,0.00005878205,0.0003238932,0.00005193081],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001232121,0.000194293,0.0006875774,0.0008978867,0.0003044139,0.0002004457,0.000435329,0.5757186,0.004235744,0.2943318,0.003068601,0.1198021],"study_design_scores_gemma":[0.00001151845,0.00005966489,0.00008784443,0.00002959914,0.00002988773,0.00002937956,0.00003758699,0.9404473,0.0006482773,0.05662556,0.001976693,0.00001675396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004867489,0.0007586997,0.9894863,0.0003550197,0.00006279374,0.00006782975,0.0000271571,0.00004657618,0.004328116],"genre_scores_gemma":[0.2128568,0.001241879,0.7783366,0.0003847805,0.000248452,0.00050725,0.0001146467,0.00009989617,0.006209667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005668846,"threshold_uncertainty_score":0.01896417,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1408224592845325,"score_gpt":0.3880737058554663,"score_spread":0.2472512465709338,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}