{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002362371,0.001185738,0.001889532,0.001032653,0.0003475746,0.00173778,0.001293452,0.001786405,0.003639099],"category_scores_gemma":[0.008414824,0.0007231144,0.001066437,0.0008279068,0.0009413603,0.001174537,0.001509642,0.001760697,0.0006540328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001162181,"about_ca_system_score_gemma":0.001440121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005169327,"about_ca_topic_score_gemma":0.0024713,"domain_scores_codex":[0.9989789,0.0004902101,0.00003725158,0.0001258158,0.000273403,0.00009447358],"domain_scores_gemma":[0.9977138,0.001579663,0.0001900798,0.0001295961,0.0003056368,0.00008122082],"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.00005904956,0.00002874414,0.0001635434,0.00009671846,0.00004333577,0.00003888563,0.00002214768,0.9528977,0.0006571746,0.03087861,0.001393477,0.01372065],"study_design_scores_gemma":[0.00000386994,0.000007045949,0.00002089516,0.000006462823,0.000004062186,0.000005342576,0.000001786713,0.9956678,0.0000768151,0.003985004,0.0002185785,0.000002264967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006877044,0.0005546773,0.9873169,0.0002677884,0.00006502754,0.00002602969,0.00005036434,0.0001181001,0.004724008],"genre_scores_gemma":[0.5220972,0.001308325,0.4641432,0.0003918915,0.00029044,0.0003547499,0.0004988873,0.0004001264,0.01051516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005169327,"threshold_uncertainty_score":0.01249355,"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."}}