{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.08064397,0.00009871514,0.0003466588,0.0004490883,0.0005436058,0.0004981456,0.002950855,0.00002264953,0.0001136322],"category_scores_gemma":[0.0117257,0.00005844913,0.000299209,0.002262084,0.0001625794,0.0005125846,0.0005041918,0.0002966514,0.00004074611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001277325,"about_ca_system_score_gemma":0.001030433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006182831,"about_ca_topic_score_gemma":0.00002439228,"domain_scores_codex":[0.9925721,0.001606493,0.001333523,0.0004010198,0.003734933,0.0003519108],"domain_scores_gemma":[0.986966,0.007058706,0.000589661,0.0009118068,0.004365428,0.000108428],"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.0002345388,0.00004920974,0.002778222,0.000003762651,0.0003753851,0.000001497754,0.000287475,0.9762576,0.0001593492,0.007026826,0.007261226,0.005564871],"study_design_scores_gemma":[0.0004944784,0.0001887142,0.006504841,0.0000218679,0.0001083442,0.000004614576,0.000267587,0.9842197,0.00001567733,0.002825941,0.005286233,0.00006202732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06912985,0.0004137424,0.9243516,0.004108227,0.0001476378,0.0004954907,0.000129305,0.000002526238,0.001221642],"genre_scores_gemma":[0.9526791,0.00004208279,0.04568991,0.00009226721,0.0002226363,0.000003190318,0.00003646099,0.00001086285,0.001223507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8835492,"threshold_uncertainty_score":0.996599,"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."}}