@article{allende_solving_2013,
	title = {Solving {Bilevel} {Programs} with the {KKT}-{Approach}},
	volume = {138},
	issn = {0025-5610, 1436-4646},
	url = {http://link.springer.com/10.1007/s10107-012-0535-x},
	doi = {10.1007/s10107-012-0535-x},
	abstract = {Bilevel programs (BL) form a special class of optimization problems. They appear in many models in economics, game theory and mathematical physics. BL programs show a more complicated structure than standard finite problems. We study the so-called KKT-approach for solving bilevel problems, where the lower level minimality condition is replaced by the KKT- or the FJ-condition. This leads to a special structured mathematical program with complementarity constraints. We analyze the KKT-approach from a generic viewpoint and reveal the advantages and possible drawbacks of this approach for solving BL problems numerically.},
	language = {en},
	number = {1-2},
	urldate = {2022-10-24},
	journal = {Mathematical Programming},
	author = {Allende, Gemayqzel Bouza and Still, Georg},
	month = apr,
	year = {2013},
	note = {104 citations (Semantic Scholar/DOI) [2022-10-24]},
	pages = {309--332},
}

{"_id":"Ppgtt96uRNxZzzmyj","bibbaseid":"allende-still-solvingbilevelprogramswiththekktapproach-2013","author_short":["Allende, G. B.","Still, G."],"bibdata":{"bibtype":"article","type":"article","title":"Solving Bilevel Programs with the KKT-Approach","volume":"138","issn":"0025-5610, 1436-4646","url":"http://link.springer.com/10.1007/s10107-012-0535-x","doi":"10.1007/s10107-012-0535-x","abstract":"Bilevel programs (BL) form a special class of optimization problems. They appear in many models in economics, game theory and mathematical physics. BL programs show a more complicated structure than standard finite problems. We study the so-called KKT-approach for solving bilevel problems, where the lower level minimality condition is replaced by the KKT- or the FJ-condition. This leads to a special structured mathematical program with complementarity constraints. We analyze the KKT-approach from a generic viewpoint and reveal the advantages and possible drawbacks of this approach for solving BL problems numerically.","language":"en","number":"1-2","urldate":"2022-10-24","journal":"Mathematical Programming","author":[{"propositions":[],"lastnames":["Allende"],"firstnames":["Gemayqzel","Bouza"],"suffixes":[]},{"propositions":[],"lastnames":["Still"],"firstnames":["Georg"],"suffixes":[]}],"month":"April","year":"2013","note":"104 citations (Semantic Scholar/DOI) [2022-10-24]","pages":"309–332","bibtex":"@article{allende_solving_2013,\n\ttitle = {Solving {Bilevel} {Programs} with the {KKT}-{Approach}},\n\tvolume = {138},\n\tissn = {0025-5610, 1436-4646},\n\turl = {http://link.springer.com/10.1007/s10107-012-0535-x},\n\tdoi = {10.1007/s10107-012-0535-x},\n\tabstract = {Bilevel programs (BL) form a special class of optimization problems. They appear in many models in economics, game theory and mathematical physics. BL programs show a more complicated structure than standard finite problems. We study the so-called KKT-approach for solving bilevel problems, where the lower level minimality condition is replaced by the KKT- or the FJ-condition. This leads to a special structured mathematical program with complementarity constraints. We analyze the KKT-approach from a generic viewpoint and reveal the advantages and possible drawbacks of this approach for solving BL problems numerically.},\n\tlanguage = {en},\n\tnumber = {1-2},\n\turldate = {2022-10-24},\n\tjournal = {Mathematical Programming},\n\tauthor = {Allende, Gemayqzel Bouza and Still, Georg},\n\tmonth = apr,\n\tyear = {2013},\n\tnote = {104 citations (Semantic Scholar/DOI) [2022-10-24]},\n\tpages = {309--332},\n}\n\n","author_short":["Allende, G. B.","Still, G."],"key":"allende_solving_2013","id":"allende_solving_2013","bibbaseid":"allende-still-solvingbilevelprogramswiththekktapproach-2013","role":"author","urls":{"Paper":"http://link.springer.com/10.1007/s10107-012-0535-x"},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/zotero/victorjhu","dataSources":["CmHEoydhafhbkXXt5"],"keywords":[],"search_terms":["solving","bilevel","programs","kkt","approach","allende","still"],"title":"Solving Bilevel Programs with the KKT-Approach","year":2013}