{"id":"W2022954527","doi":"10.1007/s11590-006-0024-3","title":"Disjunctive cuts for continuous linear bilevel programming","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Relaxation (psychology); Mathematical optimization; Computational intelligence; Computer science; Mathematics; Linear programming relaxation; Domain (mathematical analysis); Optimization problem; Artificial intelligence; 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.0001448446,0.000130638,0.0001467932,0.0001599981,0.0001980038,0.0001985422,0.0002733372,0.00004537308,0.00003122581],"category_scores_gemma":[0.00004810189,0.0001241829,0.0001037517,0.0005675593,0.00002651876,0.0005174412,0.00004473297,0.00004437486,0.00001318201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004682952,"about_ca_system_score_gemma":0.00003087759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003092802,"about_ca_topic_score_gemma":0.000003148117,"domain_scores_codex":[0.9989371,0.00003592757,0.0002655485,0.0003401515,0.0002072112,0.0002140328],"domain_scores_gemma":[0.9992583,0.00008261966,0.0001579461,0.0002152261,0.0002397463,0.00004612519],"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.000005674904,0.00005409207,0.0002807659,0.000004144234,0.00002057138,7.825616e-7,0.00004696726,0.978547,0.0000879849,0.01617088,0.003069193,0.001711934],"study_design_scores_gemma":[0.0004481697,0.00002448188,0.0001985745,0.000004955953,0.00001936312,0.000001570703,0.00000621181,0.9903423,0.00009727223,0.0001637066,0.008522673,0.0001706823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001189097,0.00001022764,0.9900535,0.00874201,0.0001803772,0.0003183567,0.000008104034,0.0001893299,0.0003791424],"genre_scores_gemma":[0.01626399,0.000002632409,0.9800341,0.002266871,0.0001924068,0.00009582654,0.0002068242,0.00001584939,0.0009215666],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01614508,"threshold_uncertainty_score":0.5064034,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007874505805032505,"score_gpt":0.2197209345693394,"score_spread":0.2118464287643069,"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."}}