{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T16:20:43Z","timestamp":1770826843246,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T00:00:00Z","timestamp":1601683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T00:00:00Z","timestamp":1601683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2020,11]]},"DOI":"10.1007\/s10957-020-01753-3","type":"journal-article","created":{"date-parts":[[2020,10,3]],"date-time":"2020-10-03T05:02:41Z","timestamp":1601701361000},"page":"488-519","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Generalized Farkas Lemma with Adjustable Variables and Two-Stage Robust Linear Programs"],"prefix":"10.1007","volume":"187","author":[{"given":"Thai Doan","family":"Chuong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaithilingam","family":"Jeyakumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,3]]},"reference":[{"key":"1753_CR1","first-page":"1","volume":"124","author":"J Farkas","year":"1901","unstructured":"Farkas, J.: Theorie der einfachen Ungleichungen. J. fur die reine und angewandte Mathematik 124, 1\u201327 (1901)","journal-title":"J. fur die reine und angewandte Mathematik"},{"key":"1753_CR2","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Proceedings of the Second Berkeley Symposium on Mathematical Statistics and probability, pp. 481\u2013492. University of California Press, Berkeley, California (1951)","DOI":"10.1525\/9780520411586-036"},{"key":"1753_CR3","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1137\/120901805","volume":"24","author":"N Dinh","year":"2014","unstructured":"Dinh, N., Goberna, M.A., L\u00f3pez, M.A., Mo, T.H.: From the Farkas lemma to the Hahn-Banach theorem. SIAM J. Optim. 24, 678\u2013701 (2014)","journal-title":"SIAM J. Optim."},{"key":"1753_CR4","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1080\/02331934.2016.1152272","volume":"66","author":"N Dinh","year":"2017","unstructured":"Dinh, N., Goberna, M.A., L\u00f3pez, M.A., Mo, T.H.: Robust optimization revisited via robust vector Farkas lemmas. Optimization 66, 939\u2013963 (2017)","journal-title":"Optimization"},{"key":"1753_CR5","volume-title":"Linear Semi-Infinite Optimization","author":"MA Goberna","year":"1998","unstructured":"Goberna, M.A., L\u00f3pez, M.A.: Linear Semi-Infinite Optimization. Wiley, Chichester (1998)"},{"key":"1753_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-014-0319-y","volume":"22","author":"N Dinh","year":"2014","unstructured":"Dinh, N., Jeyakumar, V.: Farkas\u2019 lemma: Three decades of generalizations for mathematical optimization. TOP 22, 1\u201322 (2014)","journal-title":"TOP"},{"key":"1753_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms. I Fundamentals","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms. I Fundamentals. Springer, Berlin (1993)"},{"key":"1753_CR8","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1970)"},{"key":"1753_CR9","doi-asserted-by":"crossref","unstructured":"A. Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization, Princeton Ser. Appl. Math., Princeton University Press, Princeton (2009)","DOI":"10.1515\/9781400831050"},{"key":"1753_CR10","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1016\/j.ejor.2018.08.031","volume":"277","author":"I Yanikoglu","year":"2019","unstructured":"Yanikoglu, I., Gorissen, B.L., den Hertog, D.: A survey of adjustable robust optimization. Eur. J. Oper. Res. 277, 799\u2013813 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"1753_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Program. 99, 351\u2013376 (2004)","journal-title":"Math. Program."},{"issue":"6","key":"1753_CR12","doi-asserted-by":"publisher","first-page":"1469","DOI":"10.1287\/opre.1080.0605","volume":"57","author":"A Chen","year":"2009","unstructured":"Chen, A., Zhang, Y.: Uncertain linear programs: extended affinely adjustable robust counterparts. Oper. Res. 57(6), 1469\u20131482 (2009)","journal-title":"Oper. Res."},{"key":"1753_CR13","first-page":"20","volume":"2","author":"E Delage","year":"2015","unstructured":"Delage, E., Iancu, D.A.: Robust multistage decision making. INFORMS Tutorials Oper. Res. Chap. 2, 20\u201346 (2015)","journal-title":"INFORMS Tutorials Oper. Res. Chap."},{"key":"1753_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10107-009-0331-4","volume":"130","author":"D Kuhn","year":"2011","unstructured":"Kuhn, D., Wiesemann, W., Georghiou, A.: Primal and dual linear decision rules in stochastic and robust optimization. Math. Program. 130, 177\u2013209 (2011)","journal-title":"Math. Program."},{"key":"1753_CR15","doi-asserted-by":"crossref","unstructured":"Hadjiyiannis, M.J., Goulart, P.J., Kuhn, D.: A scenario approach for estimating the suboptimality of linear decision rules in two-stage robust optimization. 50th IEEE Conference on Decision and Control and European Control Conference (CDC-ECC) Orlando, FL, USA, December 12\u201315 (2011)","DOI":"10.1109\/CDC.2011.6161342"},{"key":"1753_CR16","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.2017.1714","volume":"66","author":"J Zhen","year":"2018","unstructured":"Zhen, J., den Hertog, D., Sim, M.: Adjustable robust optimization via Fourier-Motzkin elimination. Oper. Res. 66, 1086\u20131100 (2018)","journal-title":"Oper. Res."},{"key":"1753_CR17","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF01100204","volume":"7","author":"M Ramana","year":"1995","unstructured":"Ramana, M., Goldman, A.J.: Some geometric results in semidefinite programming. J. Global Optim. 7, 33\u201350 (1995)","journal-title":"J. Global Optim."},{"key":"1753_CR18","volume-title":"An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14","author":"BS Mordukhovich","year":"2014","unstructured":"Mordukhovich, B.S., Nam, M.N.: An Easy Path to Convex Analysis and Applications, Synthesis Lectures on Mathematics and Statistics, 14. Morgan & Claypool Publishers, Williston (2014)"},{"key":"1753_CR19","doi-asserted-by":"publisher","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":"1753_CR20","volume-title":"Polytopes, Rings, and K-Theory","author":"W Bruns","year":"2009","unstructured":"Bruns, W., Gubeladze, J.: Polytopes, Rings, and K-Theory. Springer, Dordrecht (2009)"},{"key":"1753_CR21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972290","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2012","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.: Semidefinite Optimization and Convex Algebraic Geometry. World Publications, Philadelphia (2012)"},{"key":"1753_CR22","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/978-1-84800-155-8_7","volume-title":"Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences","author":"M Grant","year":"2008","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In: Blondel, V., Boyd, S., Kimura, H. (eds.) Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pp. 95\u2013110. Springer, Berlin (2008)"},{"key":"1753_CR23","unstructured":"Grant, M., Boyd, S.: CVX: Matlab software for disciplined convex programming, version 2.1. http:\/\/cvxr.com\/cvx, March (2014)"},{"key":"1753_CR24","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/ijoc.2016.0689","volume":"28","author":"D Bertsimas","year":"2016","unstructured":"Bertsimas, D., de Ruiter, F.J.C.T.: Duality in two-stage adaptive linear optimization: faster computation and stronger bounds. Inf. J. Comput. 28, 500\u2013511 (2016)","journal-title":"Inf. J. Comput."},{"issue":"4","key":"1753_CR25","first-page":"1159","volume":"25","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D., Jeyakumar, V.: Tight SDP relaxations for a class of robust SOS-convex polynomial programs without the slater condition. J. Convex Anal. 25(4), 1159\u20131182 (2018)","journal-title":"J. Convex Anal."},{"key":"1753_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11590-014-0732-z","volume":"9","author":"V Jeyakumar","year":"2015","unstructured":"Jeyakumar, V., Li, G., Perez, J.V.: Robust SOS-convex polynomial optimization problems: exact SDP relaxations. Optim. Lett. 9, 1\u201318 (2015)","journal-title":"Optim. Lett."},{"key":"1753_CR27","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1007\/s10957-013-0496-0","volume":"162","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Perez, J.V.: 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."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01753-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-020-01753-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-020-01753-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T11:58:50Z","timestamp":1723723130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-020-01753-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,3]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,11]]}},"alternative-id":["1753"],"URL":"https:\/\/doi.org\/10.1007\/s10957-020-01753-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,3]]},"assertion":[{"value":"27 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}