{"id":"W1964676846","doi":"10.4236/ajor.2011.14024","title":"Solving Bilevel Linear Multiobjective Programming Problems","year":2011,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Linear programming; Decision maker; Pareto principle; Set (abstract data type); Pareto optimal; Computer science; Linear-fractional programming; Multiobjective programming; Mathematics; Resolution (logic); Multi-objective optimization; Optimization problem; Operations research; Artificial intelligence","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.00212204,0.001421507,0.001989344,0.0007083859,0.0005984301,0.002550283,0.001138986,0.001936296,0.002839528],"category_scores_gemma":[0.005114761,0.0006374569,0.001121767,0.00130459,0.0007875319,0.001511736,0.00213034,0.002087505,0.0005826098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004851343,"about_ca_system_score_gemma":0.001129228,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001303327,"about_ca_topic_score_gemma":0.000897788,"domain_scores_codex":[0.9987932,0.0006521377,0.00006372943,0.0001490284,0.0002062409,0.000135662],"domain_scores_gemma":[0.9982759,0.001289094,0.0001297015,0.00007208697,0.0001714789,0.0000617262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000432192,0.00006039835,0.0002935917,0.0004118371,0.00007744761,0.0001309745,0.0001239662,0.9229344,0.001225531,0.03099276,0.0006906274,0.0430152],"study_design_scores_gemma":[0.00001213026,0.0000374716,0.00004027837,0.00002867458,0.00001120014,0.00003364084,0.00004925981,0.9637544,0.0005197996,0.03415357,0.001351545,0.000007969974],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009230673,0.0005556478,0.9865208,0.0001629192,0.00003261214,0.00003893284,0.00002786226,0.00005730288,0.00337331],"genre_scores_gemma":[0.4082527,0.002190225,0.5814542,0.000186216,0.0001780701,0.000477685,0.0002903724,0.0001550909,0.006815475],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002839528,"threshold_uncertainty_score":0.0112226,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.109670152862659,"score_gpt":0.3538734093731688,"score_spread":0.2442032565105098,"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."}}