{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T15:18:49Z","timestamp":1772810329776,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["11771058"],"award-info":[{"award-number":["11771058"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s40314-021-01617-0","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T22:02:25Z","timestamp":1629756145000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A relaxation solving approach for the linear trilevel programming problem"],"prefix":"10.1007","volume":"40","author":[{"given":"Yibing","family":"Lv","sequence":"first","affiliation":[]},{"given":"Jianlin","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"issue":"1","key":"1617_CR1","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.cor.2010.05.007","volume":"38","author":"HI Calvete","year":"2011","unstructured":"Calvete HI, Gal\u00e9 C, Oliveros MJ (2011) Bilevel model for production distribution planning solved by using ant colony optimization. Comput Oper Res 38(1):320\u2013327","journal-title":"Comput Oper Res"},{"key":"1617_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.cie.2013.07.012","volume":"66","author":"XS Xu","year":"2013","unstructured":"Xu XS, Meng ZQ, Shen R (2013) A tri-level programming model based on conditional value-at-risk for three-stage supply chain management. Comput Ind Eng 66:470\u2013475","journal-title":"Comput Ind Eng"},{"key":"1617_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0191-2615(04)00085-2","volume":"39","author":"SW Chiou","year":"2005","unstructured":"Chiou SW (2005) Bilevel programming for the continuous transport network design problem. Transp Res Part B 39:361\u2013383","journal-title":"Transp Res Part B"},{"issue":"1","key":"1617_CR4","first-page":"65","volume":"33","author":"L Zeng","year":"2009","unstructured":"Zeng L, Qi H, Chen Y (2009) A multiobjective bilevel programming bidding strategy model for generation companied in day ahead and real time electricity market. Power Syst Technol 33(1):65\u201370","journal-title":"Power Syst Technol"},{"key":"1617_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10107-010-0395-1","volume":"25","author":"J Pang","year":"2010","unstructured":"Pang J (2010) Three modeling paradigms in mathematical programming. Math Program 25:297\u2013323","journal-title":"Math Program"},{"key":"1617_CR6","volume-title":"Foundations of bilevel programming. Nonconvex optimization and its applications","author":"S Dempe","year":"2002","unstructured":"Dempe S (2002) Foundations of bilevel programming. Nonconvex optimization and its applications. Kluwer, Dordrecht"},{"key":"1617_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical bilevel optimization: algorithm and applications. Nonconvex optimization and its applications","author":"J Bard","year":"1998","unstructured":"Bard J (1998) Practical bilevel optimization: algorithm and applications. Nonconvex optimization and its applications. Kluwer, Dordrecht"},{"issue":"3","key":"1617_CR8","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1080\/0233193031000149894","volume":"52","author":"S Dempe","year":"2003","unstructured":"Dempe S (2003) Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Optimization 52(3):333\u2013359","journal-title":"Optimization"},{"key":"1617_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson B, Marcotte P, Savard G (2007) An overview of bilevel optimization. Ann Oper Res 153:235\u2013256","journal-title":"Ann Oper Res"},{"key":"1617_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s10287-007-0062-z","volume":"6","author":"NP Fa\u00edsca","year":"2009","unstructured":"Fa\u00edsca NP, Saraiva PM, Rustem B, Pistikopoulos EN (2009) A multi-parametric programming appraoch for multilevel hierarchical and decentralised optimization problems. CMS 6:377\u2013397","journal-title":"CMS"},{"key":"1617_CR11","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1007\/s10898-015-0341-0","volume":"64","author":"AM Kassa","year":"2016","unstructured":"Kassa AM, Kassa SM (2016) A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints. J Global Optim 64:745\u2013764","journal-title":"J Global Optim"},{"key":"1617_CR12","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1007\/s10898-017-0502-4","volume":"68","author":"AM Kassa","year":"2017","unstructured":"Kassa AM, Kassa SM (2017) Deterministic solution appraoch for some classes of nonlinear multilevel programs with multiple followers. J Global Optim 68:729\u2013747","journal-title":"J Global Optim"},{"key":"1617_CR13","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2013.06.009","volume":"41","author":"N Alguacil","year":"2014","unstructured":"Alguacil N, Delgadillo A, Arroyo JM (2014) A trilevel programming appraoch for electric grid defense planning. Comput Oper Res 41:282\u2013290","journal-title":"Comput Oper Res"},{"issue":"5","key":"1617_CR14","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1109\/TSMC.1984.6313291","volume":"14","author":"JF Bard","year":"1984","unstructured":"Bard JF (1984) An investigation of the linear three level programming problem. IEEE Trans Syst Man Cybern 14(5):711\u2013717","journal-title":"IEEE Trans Syst Man Cybern"},{"issue":"1","key":"1617_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1022610103712","volume":"93","author":"DJ White","year":"1997","unstructured":"White DJ (1997) Penalty function appraoch to linear trilevel programming. J Optim Theory Appl 93(1):183\u2013197","journal-title":"J Optim Theory Appl"},{"key":"1617_CR16","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1016\/j.ins.2009.10.013","volume":"180","author":"GQ Zhang","year":"2010","unstructured":"Zhang GQ, Lu J, Montero J, Zeng Y (2010) Model, solution concept, and Kth-best algorithm for linear trilevel programming. Inf Sci 180:481\u2013492","journal-title":"Inf Sci"},{"key":"1617_CR17","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/02331939508844060","volume":"33","author":"JJ Ye","year":"1995","unstructured":"Ye JJ, Zhu DL (1995) Optimality conditions for bilevel programming problems. Optimizaiton 33:9\u201327","journal-title":"Optimizaiton"},{"key":"1617_CR18","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.cor.2012.09.002","volume":"41","author":"S Dempe","year":"2014","unstructured":"Dempe S, Frank S (2014) Solution algorithm for an optimistic linear Stackelberg problem. Comput Oper Res 41:277\u2013281","journal-title":"Comput Oper Res"},{"key":"1617_CR19","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1972","unstructured":"Rockafellar RT (1972) Convex analysis. Princenton, USA"},{"key":"1617_CR20","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10107990015a","volume":"85","author":"F Facchinei","year":"1999","unstructured":"Facchinei F, Jiang H, Qi L (1999) A smoothing method for mathematical programs with equilibrium constraints. Math Program 85:107\u2013134","journal-title":"Math Program"},{"key":"1617_CR21","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/978-3-642-45780-7_7","volume-title":"Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. Ill-posed variational problems and regularization techniques","author":"M Fukushima","year":"1999","unstructured":"Fukushima M, Pang J (1999) Convergence of a smoothing continuation method for mathematical programs with complementarity constraints. Ill-posed variational problems and regularization techniques, vol 477. Lecture notes in economics and mathematical systems. Springer, Berlin, pp 99\u2013110"},{"key":"1617_CR22","first-page":"808","volume":"188","author":"Y Lv","year":"2007","unstructured":"Lv Y, Hu T, Wang G, Wan Z (2007) A penalty function method based on Kuhn-Tucker condition for solving linear bilevel programming. Appl Math Comput 188:808\u2013813","journal-title":"Appl Math Comput"},{"key":"1617_CR23","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10700-016-9231-2","volume":"15","author":"M Inuiguchi","year":"2016","unstructured":"Inuiguchi M, Sariddichainunta P (2016) Bilevel linear programming with ambiguous objective function of the follower. Fuzzy Optim Decis Making 15:415\u2013434","journal-title":"Fuzzy Optim Decis Making"},{"issue":"1","key":"1617_CR24","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0305-0548(95)00007-9","volume":"23","author":"HS Shih","year":"1996","unstructured":"Shih HS, Lai YJ, Lee ES (1996) Fuzzy appraoch for multi-level programming problems. Comput Oper Res 23(1):73\u201391","journal-title":"Comput Oper Res"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01617-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-021-01617-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-021-01617-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T17:38:19Z","timestamp":1632505099000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-021-01617-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":24,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1617"],"URL":"https:\/\/doi.org\/10.1007\/s40314-021-01617-0","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"24 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"226"}}