{"id":"W2396268331","doi":"10.1007/s10898-016-0438-0","title":"Robust optimization approximation for joint chance constrained optimization problem","year":2016,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Bounding overwatch; Robust optimization; Optimization problem; Mathematics; Convexity; Constrained optimization; Probabilistic logic; Constraint (computer-aided design); Continuous optimization; Computer science; Multi-swarm optimization; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.003588921,0.0003644009,0.0006974011,0.0004708377,0.0002984985,0.0004403217,0.0006097201,0.0003024699,0.0003703189],"category_scores_gemma":[0.003819137,0.0002420033,0.0003598488,0.001702896,0.0001534985,0.002889344,0.00006530088,0.0001126188,0.00001329942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004777474,"about_ca_system_score_gemma":0.0004421776,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003997789,"about_ca_topic_score_gemma":0.000003536866,"domain_scores_codex":[0.994365,0.0003200503,0.002657261,0.000559164,0.001650242,0.0004482842],"domain_scores_gemma":[0.9902455,0.0004113553,0.003748179,0.0004475221,0.004875483,0.0002719755],"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.000310085,0.0001280177,0.0006898321,0.000009113653,0.00004367458,0.000002571006,0.00006628374,0.972838,0.00006985237,0.002287852,0.003086797,0.02046792],"study_design_scores_gemma":[0.002857965,0.0004317289,0.0001246957,0.000142264,0.00009061236,0.0001113941,0.0001268284,0.9916008,0.0002166739,0.00311168,0.0008577072,0.0003277238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003972564,0.000151447,0.991796,0.003645258,0.001008225,0.0009642072,0.00009760429,0.00006787724,0.00187215],"genre_scores_gemma":[0.06012144,0.001017811,0.937682,0.0001996397,0.0004834395,0.00003471872,0.00006540439,0.0000413327,0.0003541666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05972418,"threshold_uncertainty_score":0.986861,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07599725735112603,"score_gpt":0.3229622976148248,"score_spread":0.2469650402636987,"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."}}