{"id":"W2061220204","doi":"10.1287/moor.1060.0219","title":"Constraint Qualifications and KKT Conditions for Bilevel Programming Problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Mathematics; Bilevel optimization; Mathematical optimization; Constraint programming; Constraint logic programming; Constraint satisfaction; Binary constraint; Set (abstract data type); Nonlinear programming; Sequence (biology); Optimization problem; Nonlinear system; Computer science; Stochastic programming","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.000994016,0.0000671629,0.0001270676,0.0003234395,0.0004964239,0.0002995167,0.0002733683,0.00003889916,0.00003256092],"category_scores_gemma":[0.0002485532,0.00006012104,0.00004438188,0.0006714138,0.0001666327,0.0002613249,0.0000739058,0.00007029188,0.000008030986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002333473,"about_ca_system_score_gemma":0.0001514037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007980606,"about_ca_topic_score_gemma":0.00007961901,"domain_scores_codex":[0.998853,0.00006212859,0.0003865365,0.0001955003,0.0003327217,0.0001701696],"domain_scores_gemma":[0.998116,0.0004220253,0.000044446,0.0002932636,0.001076046,0.00004828612],"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":[2.483205e-7,0.0002599103,0.00002635687,0.00005650507,0.00001706128,7.814189e-8,0.0005001245,0.02139419,0.002539957,0.9745247,0.0002726225,0.0004081864],"study_design_scores_gemma":[0.0002101781,0.00004020341,0.0001364333,0.00002388006,0.000009507292,0.000004055077,0.0002623974,0.9375185,0.0005604354,0.06013396,0.001017247,0.00008326025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002049018,0.00003135253,0.9920375,0.003865556,0.00001306671,0.0007109566,0.00005698434,0.00003748474,0.001198045],"genre_scores_gemma":[0.3960365,0.000008124637,0.6028906,0.00001031961,0.00001867318,0.0002414143,0.0001117245,0.00000582417,0.000676788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9161243,"threshold_uncertainty_score":0.3818142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1242592753038148,"score_gpt":0.4028250776607806,"score_spread":0.2785658023569658,"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."}}