{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T02:50:42Z","timestamp":1671159042813},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,9,1]],"date-time":"2005-09-01T00:00:00Z","timestamp":1125532800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2005,9]]},"DOI":"10.1007\/s10479-005-2450-5","type":"journal-article","created":{"date-parts":[[2005,8,29]],"date-time":"2005-08-29T22:51:26Z","timestamp":1125355886000},"page":"143-157","source":"Crossref","is-referenced-by-count":7,"title":["A Simplex Approach for Finding Local Solutions of a Linear Bilevel Program by Equilibrium Points"],"prefix":"10.1007","volume":"138","author":[{"given":"Manoel","family":"Camp\u00ealo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susana","family":"Scheimberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2450_CR1","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/s101070050072","volume":"85","author":"C. Audet","year":"1999","unstructured":"Audet, C., et al. (1999). \u201cA Symetrical Linear Maxmin Approach to Disjoint Bilinear Programming.\u201d Mathematical Programming 85, 573\u2013592.","journal-title":"Mathematical Programming"},{"key":"2450_CR2","doi-asserted-by":"crossref","unstructured":"Amouzegar, M. and K. Moshirvaziri. (1998). \u201cA Penalty Method for Linear Bilevel Programming Problems.\u201d In A. Migdalas, P. Pardalos, and P. V\u00e4rbrand (eds.), Multilevel Optimization: Algorithms and Applications, Kluwer Acad. Plublishers, Vol. 20, pp. 251\u2013271.","DOI":"10.1007\/978-1-4613-0307-7_11"},{"issue":"5","key":"2450_CR3","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TSMC.1984.6313291","volume":"14","author":"J.F. Bard","year":"1984","unstructured":"Bard, J.F. (1984). \u201cAn Investigation of the Linear Three Level Programming Problem.\u201d IEEE Transactions on Systems, Man and Cybernetics 14(5), 711\u2013717.","journal-title":"IEEE Transactions on Systems, Man and Cybernetics"},{"key":"2450_CR4","volume-title":"Linear Programming and Network Flows","author":"M.S. Bazaraa","year":"1990","unstructured":"Bazaraa, M.S., J.J. Jarvis, and H.D. Sherali. (1990). Linear Programming and Network Flows, 2nd edition, New York, Wiley.","edition":"2nd edition"},{"key":"2450_CR5","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF00940342","volume":"60","author":"H. Benson","year":"1989","unstructured":"Benson, H. (1989). \u201cOn the Structure and Properties of a Linear Multilevel Programming Problem.\u201d J. Optimization Theory and Applications 60, 353\u2013373.","journal-title":"J. Optimization Theory and Applications"},{"issue":"8","key":"2450_CR6","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","volume":"30","author":"W.F. Bialas","year":"1984","unstructured":"Bialas, W.F. and M.H. Karwan. (1984). \u201cTwo-Level Linear Programming.\u201d Manegement Science 30(8), 1004\u20131020.","journal-title":"Manegement Science"},{"key":"2450_CR7","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0914049","volume":"14","author":"P. Calamai","year":"1993","unstructured":"Calamai, P. and L. Vicente. (1993). \u201cGenerating Linear and Linear-Quadratic Bilevel Programming Problems.\u201d SIAM J. Scientific and Statistical Computing 14, 770\u2013782.","journal-title":"SIAM J. Scientific and Statistical Computing"},{"key":"2450_CR8","unstructured":"Camp\u00ealo, M. (1999). \u201cPrograma\u00e7\u00e3o Linear em Dois N\u00edveis: Uma abordagem Te\u00f3rica e computacional.\u201d PhD Thesis, Universidade Federal do Rio de Janeiro, Brazil (Portuguese)."},{"key":"2450_CR9","doi-asserted-by":"crossref","unstructured":"Camp\u00ealo, M. and S. Scheimberg. (2001). \u201cTheoretical and Computational Results for a Linear Bilevel Problem.\u201d In N. Hadjisavvas and P. Pardalos (eds.), Advances in Convex Analysis and Global Optimization, Kluwer Acad. Publishers. Vol. 54, pp. 269\u2013281.","DOI":"10.1007\/978-1-4613-0279-7_14"},{"issue":"1","key":"2450_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s10957-004-1711-9","volume":"125","author":"M. Camp\u00ealo","year":"2005","unstructured":"Camp\u00ealo, M. and S. Scheimberg. (2005). \u201cA Study of Local Solutions in Linear Bilevel Programming.\u201d J. Optimization Theory and Applications 125(1), 63\u201384.","journal-title":"J. Optimization Theory and Applications"},{"issue":"5","key":"2450_CR11","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","volume":"13","author":"P. Hansen","year":"1992","unstructured":"Hansen, P., B. Jaumard, and G. Savard. (1992). \u201cNew Branch-and-Bound Rules for Linear Bilevel Programming.\u201d SIAM J. Scientific and Statistical Computing 13(5), 1194\u20131217.","journal-title":"SIAM J. Scientific and Statistical Computing"},{"key":"2450_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02098174","volume":"34","author":"J. J\u00fadice","year":"1992","unstructured":"J\u00fadice, J. and A. Faustino. (1992). \u201cA Sequential LCP method for Bilevel Linear Programming.\u201d Annals of Operations Research 34, 89\u2013106.","journal-title":"Annals of Operations Research"},{"key":"2450_CR13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01580367","volume":"11","author":"H. Konno","year":"1976","unstructured":"Konno, H. (1976). \u201cA Cutting Plane Algorithm for Solving Bilinear Programs.\u201d Mathematical Programming 11, 14\u201327.","journal-title":"Mathematical Programming"},{"key":"2450_CR14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02592205","volume":"75","author":"Z.-Q. Luo","year":"1996","unstructured":"Luo, Z.-Q., et al. (1996). \u201cExact Penalization and Stationary Conditions of Mathematical Programs with Equilibrium Constraints.\u201d Mathematical Programming 75, 19\u201376.","journal-title":"Mathematical Programming"},{"key":"2450_CR15","unstructured":"Migdalas, A., P. Pardalos, and P. V\u00e4rbrand, (eds.) (1998). Multilevel Optimization: Algorithms and Applications, Nonconvex Optimization and its Applications, Kluwer Acad. Plublishers, Vol. 20."},{"key":"2450_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1023\/B:NUMA.0000021760.62160.a4","volume":"35","author":"C.H. Sab\u00f3ia","year":"2004","unstructured":"Sab\u00f3ia, C.H., M. Camp\u00ealo, and S. Scheimberg. (2004). \u201cA Computational Study of Global Algorithms for Linear Bilevel Programming.\u201d Numerical Algorithms 35, 155\u2013173.","journal-title":"Numerical Algorithms"},{"key":"2450_CR17","doi-asserted-by":"crossref","unstructured":"Tuy, H. and S. Ghannadan. (1998). \u201cA New Branch-and-Bound Method for Bilevel Linear Programs.\u201d In A. Migdalas, P. Pardalos, and P. V\u00e4rbrand (eds.), Multilevel Optimization: Algorithms and Applications, Kluwer Acad. Publishers, Vol. 20, pp. 231\u2013249.","DOI":"10.1007\/978-1-4613-0307-7_10"},{"key":"2450_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01096458","volume":"5","author":"L. Vicente","year":"1994","unstructured":"Vicente L. and P. Calamai. (1994). \u201cBilevel and Multilevel Programming: A Bibliography Review.\u201d J. Global Optimization 5, 291\u2013306.","journal-title":"J. Global Optimization"},{"key":"2450_CR19","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01096412","volume":"3","author":"D.J. White","year":"1993","unstructured":"White, D.J. and G. Anandalingam. (1993). \u201cA Penalty Function Approach for Solving Bi-Level Linear Programs.\u201d J. Global Optimization 3, 397\u2013419.","journal-title":"J. Global Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2450-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-005-2450-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-005-2450-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:59:34Z","timestamp":1559138374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-005-2450-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,9]]}},"alternative-id":["2450"],"URL":"https:\/\/doi.org\/10.1007\/s10479-005-2450-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9]]}}}