{"id":"W2255521334","doi":"10.1016/j.compchemeng.2016.02.005","title":"Linear programming-based scenario reduction using transportation distance","year":2016,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Reduction (mathematics); Mathematical optimization; Linear programming; Set (abstract data type); Stochastic programming; Computer science; Minification; Dynamic programming; Algorithm; Mathematics","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002712276,0.0001380091,0.000172547,0.0001288781,0.00004400719,0.00006688579,0.0002364411,0.00007950083,0.00001337568],"category_scores_gemma":[0.0001404215,0.00009904673,0.00009231437,0.0005011591,0.0000402886,0.0002750896,0.000009812065,0.00007759339,0.00001248826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000816947,"about_ca_system_score_gemma":0.00003472953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005614783,"about_ca_topic_score_gemma":3.430287e-7,"domain_scores_codex":[0.9985401,0.00001300767,0.0004136749,0.0003542675,0.0004549408,0.0002239917],"domain_scores_gemma":[0.9992388,0.0001466278,0.0001134391,0.0002528912,0.0001342124,0.0001140619],"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.0000339975,0.00004056897,0.0008929903,0.000008906287,0.000009792836,0.000006108492,0.0001450252,0.7579539,0.1081085,0.0002419795,0.0002403913,0.1323178],"study_design_scores_gemma":[0.0004154323,0.00001695832,0.0003037093,0.00009536712,0.00001081588,0.000005059063,0.000006446342,0.9379544,0.05076877,0.0001004922,0.01010553,0.0002170849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2364838,0.00002914771,0.762715,0.0001495309,0.0004138146,0.00008592162,0.000003318295,0.0001134136,0.000006107442],"genre_scores_gemma":[0.8539636,0.000004759638,0.145769,0.00001378715,0.0001931704,0.000004843036,0.0000117217,0.00001615513,0.00002296034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6174798,"threshold_uncertainty_score":0.4039009,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03656416774600321,"score_gpt":0.2955963544794652,"score_spread":0.259032186733462,"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."}}