{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T12:41:12Z","timestamp":1768480872725,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T00:00:00Z","timestamp":1485993600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10957-017-1069-4","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T16:48:32Z","timestamp":1486054112000},"page":"683-703","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Finding Robust Global Optimal Values of Bilevel Polynomial Programs with Uncertain Linear Constraints"],"prefix":"10.1007","volume":"173","author":[{"given":"T. D.","family":"Chuong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Jeyakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,2]]},"reference":[{"key":"1069_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2836-1","volume-title":"Practical Bilevel Optimization: Algorithms and Applications","author":"JF Bard","year":"1998","unstructured":"Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"1069_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/s10479-007-0176-2","volume":"153","author":"B Colson","year":"2007","unstructured":"Colson, B., Marcotte, P., Savard, G.: An overview of bilevel programming. Ann. Oper. Res. 153, 235\u2013256 (2007)","journal-title":"Ann. Oper. Res."},{"key":"1069_CR3","volume-title":"Foundations of Bilevel Programming","author":"S Dempe","year":"2002","unstructured":"Dempe, S.: Foundations of Bilevel Programming. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"1069_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-45827-3","volume-title":"Bilevel Programming Problems: Theory, Algorithms and Application to Energy Networks","author":"S Dempe","year":"2015","unstructured":"Dempe, S., Kalashnikov, V., Perez-Valdes, G.A., Kalashnykova, N.: Bilevel Programming Problems: Theory, Algorithms and Application to Energy Networks. Springer, Berlin (2015)"},{"key":"1069_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1011268113791","volume":"20","author":"ZH G\u00fcm\u00fcs","year":"2001","unstructured":"G\u00fcm\u00fcs, Z.H., Floudas, C.A.: Global optimization of nonlinear bilevel programming problems. J. Global Optim. 20, 1\u201331 (2001)","journal-title":"J. Global Optim."},{"key":"1069_CR6","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/s10957-012-0161-z","volume":"157","author":"S Dempe","year":"2013","unstructured":"Dempe, S., Gadhi, N., Zemkoho, A.B.: New optimality conditions for the semivectorial bilevel optimization problem. J. Optim. Theory Appl. 157, 54\u201374 (2013)","journal-title":"J. Optim. Theory Appl."},{"key":"1069_CR7","doi-asserted-by":"crossref","first-page":"1885","DOI":"10.1137\/080725088","volume":"20","author":"JJ Ye","year":"2010","unstructured":"Ye, J.J., Zhu, D.L.: New necessary optimality conditions for bilevel programs by combining MPEC and the value function approach. SIAM J. Optim. 20, 1885\u20131905 (2010)","journal-title":"SIAM J. Optim."},{"key":"1069_CR8","volume-title":"Robust Optimization, Princeton Series Applied Mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization, Princeton Series Applied Mathematics. Princeton University Press, Princeton (2009)"},{"key":"1069_CR9","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D.B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"1069_CR10","doi-asserted-by":"crossref","first-page":"453","DOI":"10.1007\/s101070100286","volume":"92","author":"A Ben-Tal","year":"2002","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust optimizationmethodology and applications. ISMP 2000, Part 2 (Atlanta, GA). Math. Program. 92, 453\u2013480 (2002)","journal-title":"Math. Program."},{"key":"1069_CR11","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10107-006-0092-2","volume":"112","author":"A Ben-Tal","year":"2008","unstructured":"Ben-Tal, A., Nemirovski, A.: Selected topics in robust convex optimization. Math. Program. 112, 125\u2013158 (2008)","journal-title":"Math. Program."},{"key":"1069_CR12","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/j.ejor.2013.09.036","volume":"235","author":"V Gabrel","year":"2014","unstructured":"Gabrel, V., Murat, C., Thiele, A.: Recent advances in robust optimization: an overview. Eur. J. Oper. Res. 235, 471\u2013483 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"1069_CR13","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1287\/opre.38.3.556","volume":"38","author":"O Ben-Ayed","year":"1990","unstructured":"Ben-Ayed, O., Blair, C.E.: Computational difficulties of bilevel linear programming. Oper. Res. 38, 556\u2013560 (1990)","journal-title":"Oper. Res."},{"key":"1069_CR14","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M Putinar","year":"1993","unstructured":"Putinar, M.: Positive polynomials on compact semi-algebraic sets. Indiana Univ. Math. J. 42, 203\u2013206 (1993)","journal-title":"Indiana Univ. Math. J."},{"key":"1069_CR15","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s10957-014-0545-3","volume":"163","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Lasserre, J.B., Li, G.: On polynomial optimization over non-compact semi-algebraic sets. J. Optim. Theory Appl. 163, 707\u2013718 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1069_CR16","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10898-015-0356-6","volume":"65","author":"V Jeyakumar","year":"2016","unstructured":"Jeyakumar, V., Kim, S., Lee, G.M., Li, G.: Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and semialgebraic feasible sets. J. Global Optim. 65, 175\u2013190 (2016)","journal-title":"J. Global Optim."},{"key":"1069_CR17","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1137\/15M1017922","volume":"26","author":"V Jeyakumar","year":"2016","unstructured":"Jeyakumar, V., Lasserre, J.B., Li, G., Pham, T.S.: Convergent semidefinite programming relaxations for global bilevel polynomial optimization problems. SIAM J. Optim. 26, 753\u2013780 (2016)","journal-title":"SIAM J. Optim."},{"key":"1069_CR18","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s10957-013-0496-0","volume":"162","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Vicente-Perez, J.: Dual semidefinite programs without duality gaps for a class of convex minimax programs. J. Optim. Theory Appl. 162, 735\u2013753 (2014)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1069_CR19","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.orl.2013.11.005","volume":"42","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Pham, T.S., Li, G.: Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. Oper. Res. Lett. 42(1), 34\u201340 (2014)","journal-title":"Oper. Res. Lett."},{"key":"1069_CR20","doi-asserted-by":"crossref","DOI":"10.1142\/p665","volume-title":"Moments, Positive Polynomials and Their Applications","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B.: Moments, Positive Polynomials and Their Applications. Imperial College Press, London (2009)"},{"key":"1069_CR21","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1016\/j.laa.2016.11.008","volume":"515","author":"TD Chuong","year":"2017","unstructured":"Chuong, T.D., Jeyakumar, V.: A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals. Linear Algebra Appl. 515, 38\u201352 (2017)","journal-title":"Linear Algebra Appl."},{"key":"1069_CR22","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/j.orl.2015.05.006","volume":"43","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Li, G.: A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. Oper. Res. Lett. 43, 405\u2013410 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1069_CR23","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(99)00052-8","volume":"25","author":"M Patriksson","year":"1999","unstructured":"Patriksson, M., Wynter, L.: Stochastic mathematical programs with equilibrium constraints. Oper. Res. Lett. 25, 159\u2013167 (1999)","journal-title":"Oper. Res. Lett."},{"key":"1069_CR24","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1080\/02331934.2013.848862","volume":"64","author":"A Budnitzki","year":"2015","unstructured":"Budnitzki, A.: The solution approach to linear fuzzy bilevel optimization problems. Optimization 64, 1195\u20131209 (2015)","journal-title":"Optimization"},{"key":"1069_CR25","unstructured":"Loridan, P., Morgan, J.: Approximate solutions for two-level optimization problems. Trends in mathematical optimization (Irsee 1986), Internat. Schriftenreihe Numer. Math., 84, pp. 181\u2013196. Birkhuser, Basel, (1988)"},{"key":"1069_CR26","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jpaa.2006.05.028","volume":"209","author":"J Demmel","year":"2007","unstructured":"Demmel, J., Nie, J., Powers, V.: Representations of positive polynomials on noncompact semialgebraic sets via KKT ideals. J. Pure Appl. Algebra 209, 189\u2013200 (2007)","journal-title":"J. Pure Appl. Algebra"},{"key":"1069_CR27","first-page":"492","volume":"61","author":"C Vinzant","year":"2014","unstructured":"Vinzant, C.: What is a spectrahedron? Not. Am. Math. Soc. 61, 492\u2013494 (2014)","journal-title":"Not. Am. Math. Soc."},{"key":"1069_CR28","doi-asserted-by":"crossref","unstructured":"Lofberg, J.: YALMIP: A toolbox for modeling and optimization in MATLAB. In: Proceedings of the CACSD Conference, Taipei, Taiwan (2004)","DOI":"10.1109\/CACSD.2004.1393890"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-017-1069-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-017-1069-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T01:46:51Z","timestamp":1692668811000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-017-1069-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,2]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1069"],"URL":"https:\/\/doi.org\/10.1007\/s10957-017-1069-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,2]]}}}