{"id":"W4284879750","doi":"10.1007/s00500-022-07242-1","title":"Mehar approach to solve neutrosophic linear programming problems using possibilistic mean","year":2022,"lang":"en","type":"article","venue":"Soft Computing","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":false,"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.001233882,0.0005787147,0.001295585,0.001205486,0.0008727243,0.001213516,0.001440854,0.001383293,0.00506275],"category_scores_gemma":[0.002265909,0.0005261981,0.001391741,0.001231138,0.0006282808,0.00138042,0.001464084,0.002089012,0.0007202822],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005620854,"about_ca_system_score_gemma":0.0007857172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001100591,"about_ca_topic_score_gemma":0.001967445,"domain_scores_codex":[0.9992272,0.0003161244,0.0000359803,0.00008099066,0.0002806911,0.00005912753],"domain_scores_gemma":[0.9991998,0.0005386816,0.00003354629,0.00004231935,0.0001614702,0.00002412167],"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.0001344917,0.0002202649,0.0003862019,0.0005970476,0.0002544691,0.0001567525,0.0001914675,0.4645829,0.009739951,0.3742201,0.00348556,0.1460307],"study_design_scores_gemma":[0.000008078894,0.00005258448,0.00006905841,0.0000154397,0.00002333674,0.00003276861,0.00002129534,0.9371357,0.001084481,0.05964623,0.001896833,0.00001412933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004646581,0.0004216907,0.9907815,0.0001816844,0.00007270145,0.00002619697,0.00002736693,0.0000519896,0.003790161],"genre_scores_gemma":[0.2978926,0.0008897497,0.6867116,0.000344175,0.0002450426,0.0003058433,0.0001139858,0.0001298424,0.01336724],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00506275,"threshold_uncertainty_score":0.0169366,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03356088813301084,"score_gpt":0.252161515888293,"score_spread":0.2186006277552822,"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."}}