{"id":"W2960490086","doi":"10.1016/j.ejor.2019.07.012","title":"A conic relaxation model for searching for the global optimum of network data envelopment analysis","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Innovative Research Group Project of the National Natural Science Foundation of China","keywords":"Conic section; Data envelopment analysis; Mathematical optimization; Relaxation (psychology); Linear programming; Multiplier (economics); Computer science; Computation; Linear model; Network model; Mathematics; Algorithm; Data mining","routes":{"ca_aff":true,"ca_fund":true,"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.002929845,0.001194571,0.002393252,0.001215779,0.0006874206,0.002502643,0.001748198,0.002229743,0.004262521],"category_scores_gemma":[0.006192062,0.001081838,0.001263005,0.002354539,0.001339751,0.001843828,0.001761387,0.00297908,0.0003869175],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001939268,"about_ca_system_score_gemma":0.002321952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01573678,"about_ca_topic_score_gemma":0.007283297,"domain_scores_codex":[0.998997,0.0006261398,0.00003000726,0.000111259,0.0001208764,0.0001146606],"domain_scores_gemma":[0.9975002,0.001929744,0.000174321,0.00008090051,0.0002289191,0.00008592191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002264096,0.00001593954,0.0000538195,0.0000316515,0.00001249883,0.00001424957,0.00001447099,0.9860237,0.00007682257,0.01058885,0.0003761416,0.002769186],"study_design_scores_gemma":[0.000004583309,0.000009152532,0.00001774544,0.000006721496,0.000003291504,0.000002472401,0.000005493711,0.9965817,0.00002887181,0.003125615,0.0002118346,0.00000259459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0166194,0.000771385,0.9712928,0.000482933,0.00005838066,0.00007354503,0.0001548168,0.00006165662,0.01048511],"genre_scores_gemma":[0.7102867,0.00155642,0.2740411,0.0003193171,0.0001292328,0.0005490755,0.0004609186,0.0001649272,0.01249238],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01573678,"threshold_uncertainty_score":0.03129035,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.4024850938230459,"score_gpt":0.5118073584611952,"score_spread":0.1093222646381493,"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."}}