{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T19:16:30Z","timestamp":1726514190114},"reference-count":20,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1994,6]]},"DOI":"10.1016\/0167-6377(94)90086-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"265-272","source":"Crossref","is-referenced-by-count":141,"title":["The steepest descent direction for the nonlinear bilevel programming problem"],"prefix":"10.1016","volume":"15","author":[{"given":"Gilles","family":"Savard","sequence":"first","affiliation":[]},{"given":"Jacques","family":"Gauvin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(94)90086-8_BIB1","first-page":"444","article-title":"Hierarchical decentralized systems and its new solution by a barrier method","volume":"SMC-11","author":"Aiyoshi","year":"1981","journal-title":"IEEE Trans. Systems, Man Cybern."},{"key":"10.1016\/0167-6377(94)90086-8_BIB2","doi-asserted-by":"crossref","first-page":"1111","DOI":"10.1109\/TAC.1984.1103455","article-title":"A solution method for the static constrained Stackelberg problem via penalty method","volume":"AC-29","author":"Aiyoshi","year":"1984","journal-title":"IEEE Trans. Automat. Control"},{"issue":"2","key":"10.1016\/0167-6377(94)90086-8_BIB3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1287\/moor.8.2.260","article-title":"An algorithm for solving the general bilevel programming problem","volume":"8","author":"Bard","year":"1983","journal-title":"Math. Oper. Res."},{"issue":"1","key":"10.1016\/0167-6377(94)90086-8_BIB4","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF01580720","article-title":"Convex two-level programming","volume":"40","author":"Bard","year":"1988","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(94)90086-8_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0305-0548(82)90007-7","article-title":"An explicit solution to the multi-level programming problem","volume":"9","author":"Bard","year":"1982","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"10.1016\/0167-6377(94)90086-8_BIB6","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1137\/0911017","article-title":"A branch and bound algorithm for the bilevel programming problem","volume":"11","author":"Bard","year":"1990","journal-title":"SIAM J. Scientific and Statist. Comput."},{"issue":"1","key":"10.1016\/0167-6377(94)90086-8_BIB7","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/TAC.1982.1102880","article-title":"On two-level linear optimization","volume":"AC-27","author":"Bialas","year":"1982","journal-title":"IEEE Trans. Automat. Control"},{"issue":"8","key":"10.1016\/0167-6377(94)90086-8_BIB8","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1287\/mnsc.30.8.1004","article-title":"Two-level linear programming","volume":"30","author":"Bialas","year":"1984","journal-title":"Management Sci."},{"issue":"1","key":"10.1016\/0167-6377(94)90086-8_BIB9","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0305-0548(82)90006-5","article-title":"A linear two-level programming problem","volume":"9","author":"Candler","year":"1982","journal-title":"Comp. Oper. Res."},{"key":"10.1016\/0167-6377(94)90086-8_BIB10","series-title":"Proc. 18th IFIP Conf.","article-title":"Optimality conditions for bilevel programming problems","author":"Dempe","year":"1991"},{"issue":"9","key":"10.1016\/0167-6377(94)90086-8_BIB11","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1057\/jors.1981.156","article-title":"A representation and economic interpretation of a two-level programming problem","volume":"32","author":"Fortuny-Amat","year":"1981","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/0167-6377(94)90086-8_BIB12","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1287\/moor.13.4.629","article-title":"Directional behaviour of optimal solutions in nonlinear mathematical programming","volume":"13","author":"Gauvin","year":"1988","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(94)90086-8_BIB13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02055197","article-title":"Directional derivative of the value function in parametric optimization","volume":"27","author":"Gauvin","year":"1990","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"10.1016\/0167-6377(94)90086-8_BIB14","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1137\/0913069","article-title":"A variable elimination algorithm for bilevel linear programming","volume":"13","author":"Hansen","year":"1992","journal-title":"SIAM J. Scientific and Statist. Comput."},{"key":"10.1016\/0167-6377(94)90086-8_BIB15","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/opre.21.1.188","article-title":"Directional derivative for extermal-value functions with applications to the completely convex case","volume":"21","author":"Hogan","year":"1973","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(94)90086-8_BIB16","article-title":"An exact algorithm for convex bilevel programming","author":"Jaumard","year":"1994"},{"key":"10.1016\/0167-6377(94)90086-8_BIB17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BFb0121215","article-title":"Solution point differentiability without strict complementary in nonlinear programming","volume":"21","author":"Jittorntrum","year":"1984","journal-title":"Math. Programming Study"},{"issue":"1","key":"10.1016\/0167-6377(94)90086-8_BIB18","first-page":"77","article-title":"The solution of the linear bilevel programming problem by using the linear complementary problem","volume":"8","author":"Judice","year":"1988","journal-title":"Investiga\u00e7\u00e3o Oper."},{"key":"10.1016\/0167-6377(94)90086-8_BIB19","article-title":"Nondifferentiable Optimization","author":"Lemar\u00e9chal","year":"1989"},{"issue":"2","key":"10.1016\/0167-6377(94)90086-8_BIB20","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/00207728408926552","article-title":"An algorithm for solving two-level convex optimization problems","volume":"15","author":"Tanino","year":"1984","journal-title":"Int. J. Systems Sci."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900868?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637794900868?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:52:40Z","timestamp":1552902760000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637794900868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":20,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0167637794900868"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(94)90086-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}