{"id":"W2058139875","doi":"10.1016/j.compchemeng.2015.01.003","title":"Optimal robust optimization approximation for chance constrained optimization problem","year":2015,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematical optimization; Robust optimization; Optimization problem; Portfolio optimization; Constrained optimization; Random optimization; Set (abstract data type); Continuous optimization; Computer science; Constraint (computer-aided design); Mathematics; Multi-swarm optimization; Portfolio","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.0009214215,0.0002426094,0.000329652,0.0002509292,0.00006868596,0.0002862092,0.0004349353,0.0001655093,0.00001668549],"category_scores_gemma":[0.0009175508,0.0002309425,0.0001072165,0.000766841,0.00004676357,0.0006354218,0.00008961852,0.0001220198,0.00000890979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001136749,"about_ca_system_score_gemma":0.0000818616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001871813,"about_ca_topic_score_gemma":5.580299e-8,"domain_scores_codex":[0.9977549,0.00002888661,0.0006999035,0.0005333638,0.0006376586,0.0003453433],"domain_scores_gemma":[0.9982086,0.0003160795,0.0002527892,0.0003230432,0.0006456592,0.0002538582],"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.00003175618,0.0000303613,0.00001469877,0.00001001928,0.00001134213,8.055437e-7,0.0002288019,0.9934221,0.0003549182,0.0005842932,0.00154193,0.003769],"study_design_scores_gemma":[0.0009003007,0.00004669954,0.000002101981,0.00003039716,0.00001385397,0.00001275423,0.00004141603,0.9953704,0.002213182,0.0001378599,0.0009621052,0.0002689614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002286369,0.00006333317,0.9956406,0.000299794,0.0005587832,0.0005804119,0.00001089324,0.0002533066,0.0003065003],"genre_scores_gemma":[0.06390352,0.00001461487,0.9353381,0.00006110437,0.0002937274,0.00007587853,0.0002137419,0.00003636245,0.0000629002],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.06161715,"threshold_uncertainty_score":0.9417561,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05689615215590723,"score_gpt":0.2836567750094067,"score_spread":0.2267606228534994,"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."}}