{"id":"W2752265761","doi":"","title":"Disjunctive Cuts for Continuous Linear Bilevel Programming","year":2006,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Mathematics; Relaxation (psychology); Mathematical optimization; Domain (mathematical analysis); Linear programming relaxation; Computer science; Optimization problem; Discrete 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.0004409435,0.0002441605,0.000297357,0.0003515724,0.0003107855,0.0003189073,0.0006552654,0.0001528322,0.00001245242],"category_scores_gemma":[0.0001401799,0.0002298607,0.0002328044,0.000861279,0.00004168672,0.0005442614,0.0001669911,0.0001443304,0.00001419167],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001971817,"about_ca_system_score_gemma":0.0001699961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003118443,"about_ca_topic_score_gemma":0.0007678382,"domain_scores_codex":[0.9981558,0.00006456398,0.0004304168,0.0005053759,0.0003179119,0.0005258708],"domain_scores_gemma":[0.9985501,0.0001545648,0.0002373549,0.0005552269,0.0003548211,0.0001479987],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006556513,0.0006994422,0.01612842,0.00003082867,0.0001232884,0.00001769306,0.0002060915,0.06806678,0.001273392,0.8412898,0.006728754,0.06536998],"study_design_scores_gemma":[0.0005081807,0.0001179681,0.008656519,0.00001331921,0.00003352851,0.00001602264,0.00001771696,0.9627126,0.00148521,0.01033052,0.01577144,0.0003369343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001337701,0.0001661456,0.9915692,0.00486531,0.0001069767,0.0007392574,0.0000309019,0.0007553396,0.0004291928],"genre_scores_gemma":[0.2259194,0.0000111305,0.7692,0.001069541,0.0002028712,0.0006453512,0.00007415967,0.00002886435,0.002848676],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8946459,"threshold_uncertainty_score":0.9373447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009667093480283412,"score_gpt":0.2307124682172781,"score_spread":0.2210453747369947,"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."}}