{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:39Z","timestamp":1740145179602,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T00:00:00Z","timestamp":1580688000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI 1561918"],"award-info":[{"award-number":["CMMI 1561918"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s11590-020-01539-6","type":"journal-article","created":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T19:04:56Z","timestamp":1580756696000},"page":"1627-1642","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust continuous linear programs"],"prefix":"10.1007","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6093-5340","authenticated-orcid":false,"given":"Archis","family":"Ghate","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,3]]},"reference":[{"key":"1539_CR1","unstructured":"Anderson, E.J.: A Continuous Model for Job-Shop Scheduling. Ph.D. thesis, University of Cambridge, Cambridge (1978)"},{"key":"1539_CR2","volume-title":"Linear Programming in Infinite-Dimensional Spaces: Theory and Applications","author":"EJ Anderson","year":"1987","unstructured":"Anderson, E.J., Nash, P.: Linear Programming in Infinite-Dimensional Spaces: Theory and Applications. Wiley, Chichester (1987)"},{"issue":"5","key":"1539_CR3","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1137\/0321046","volume":"21","author":"EJ Anderson","year":"1983","unstructured":"Anderson, E.J., Nash, P., Perold, A.F.: Some properties of a class of continuious linear programs. SIAM J. Control Optim. 21(5), 758\u2013765 (1983)","journal-title":"SIAM J. Control Optim."},{"issue":"4","key":"1539_CR4","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1002\/net.3230190403","volume":"19","author":"EJ Anderson","year":"1989","unstructured":"Anderson, E.J., Philpott, A.B.: A continuous-time network simplex algorithm. Networks 19(4), 395\u2013425 (1989)","journal-title":"Networks"},{"issue":"2","key":"1539_CR5","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1137\/110822992","volume":"22","author":"D Bampou","year":"2012","unstructured":"Bampou, D., Kuhn, D.: Polynomial approximations for continuous linear programs. SIAM J. Optim. 22(2), 628\u2013648 (2012)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"1539_CR6","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1073\/pnas.39.9.947","volume":"39","author":"RE Bellman","year":"1953","unstructured":"Bellman, R.E.: Bottleneck problem and dynamic programming. Proc. Natl. Acad. Sci. 39(9), 947\u2013951 (1953)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"1539_CR7","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of linear programming problems contaminated with uncertain data. Math. Program. 88(3), 411\u2013424 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1539_CR8","doi-asserted-by":"publisher","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(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"1","key":"1539_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"1539_CR10","volume-title":"Introduction to Linear Optimization","author":"D Bertsimas","year":"1997","unstructured":"Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)"},{"issue":"3","key":"1539_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01956855","volume":"17","author":"RN Buie","year":"1973","unstructured":"Buie, R.N., Abrham, J.: Numerical solutions to continuous linear programming problems. Math. Methods Oper. Res. 17(3), 107\u2013117 (1973)","journal-title":"Math. Methods Oper. Res."},{"issue":"4","key":"1539_CR12","doi-asserted-by":"publisher","first-page":"785","DOI":"10.1287\/moor.1050.0166","volume":"30","author":"L Fleischer","year":"2005","unstructured":"Fleischer, L., Sethuraman, J.: Efficient algorithms for separated continuous linear programs: the multicommodity flow problem with holding costs and extensions. Math. Oper. Res. 30(4), 785\u20131040 (2005)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1539_CR13","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1007\/s11590-015-0958-4","volume":"10","author":"A Ghate","year":"2016","unstructured":"Ghate, A.: Robust optimization in countably infinite linear programs. Optim. Lett. 10(4), 847\u2013863 (2016)","journal-title":"Optim. Lett."},{"issue":"1","key":"1539_CR14","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1137\/0118011","volume":"18","author":"RC Grinold","year":"1970","unstructured":"Grinold, R.C.: Symmetric duality for continuous linear programs. SIAM J. Appl. Math. 18(1), 32\u201351 (1970)","journal-title":"SIAM J. Appl. Math."},{"issue":"3","key":"1539_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BF01300870","volume":"4","author":"S Ito","year":"1995","unstructured":"Ito, S., Kelley, C.T., Sachs, E.W.: Inexact primal dual interior point iteration for linear program in function spaces. Comput. Optim. Appl. 4(3), 189\u2013201 (1995)","journal-title":"Comput. Optim. Appl."},{"key":"1539_CR16","volume-title":"Introductory Real Analysis","author":"AN Kolmogorov","year":"1975","unstructured":"Kolmogorov, A.N., Fomin, S.V.: Introductory Real Analysis. Dover, New York (1975)"},{"issue":"1","key":"1539_CR17","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0022-247X(66)90187-9","volume":"16","author":"N Levinson","year":"1966","unstructured":"Levinson, N.: A class of continuous linear programming problems. J. Math. Anal. Appl. 16(1), 73\u201383 (1966)","journal-title":"J. Math. Anal. Appl."},{"key":"1539_CR18","volume-title":"Optimization by Vector Space Methods","author":"DG Luenberger","year":"1969","unstructured":"Luenberger, D.G.: Optimization by Vector Space Methods. Wiley, New York (1969)"},{"issue":"1","key":"1539_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/S0363012995292664","volume":"37","author":"X Luo","year":"1998","unstructured":"Luo, X., Bertsimas, D.: A new algorithm for state-constrained separated continuous linear programs. SIAM J. Control Optim. 37(1), 177\u2013210 (1998)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1539_CR20","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1137\/0319005","volume":"19","author":"AF Perold","year":"1981","unstructured":"Perold, A.F.: Extreme points and basic feasible solutions in continuous time linear programming. SIAM J. Control Optim. 19(1), 52\u201363 (1981)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1539_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/net.3230260102","volume":"26","author":"AB Philpott","year":"1995","unstructured":"Philpott, A.B., Craddock, M.: An adaptive discretization algorithm for a class of continuous network programs. Networks 26(1), 1\u201311 (1995)","journal-title":"Networks"},{"issue":"6","key":"1539_CR22","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1137\/0331073","volume":"31","author":"MC Pullan","year":"1993","unstructured":"Pullan, M.C.: An algorithm for a class of continuous linear programs. SIAM J. Control Optim. 31(6), 1558\u20131577 (1993)","journal-title":"SIAM J. Control Optim."},{"issue":"6","key":"1539_CR23","doi-asserted-by":"publisher","first-page":"1952","DOI":"10.1137\/S0363012993247858","volume":"33","author":"MC Pullan","year":"1995","unstructured":"Pullan, M.C.: Forms of optimal solutions for separated continuous linear programs. SIAM J. Control Optim. 33(6), 1952\u20131977 (1995)","journal-title":"SIAM J. Control Optim."},{"issue":"3","key":"1539_CR24","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1137\/S0363012993257507","volume":"34","author":"MC Pullan","year":"1996","unstructured":"Pullan, M.C.: A duality theory for separated continuous linear programs. SIAM J. Control Optim. 34(3), 931\u2013965 (1996)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1539_CR25","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1006\/jmaa.1996.0016","volume":"197","author":"MC Pullan","year":"1996","unstructured":"Pullan, M.C.: Linear optimal control problems with piecewise analytic solutions. J. Math. Anal. Appl. 197(1), 207\u2013226 (1996)","journal-title":"J. Math. Anal. Appl."},{"issue":"3","key":"1539_CR26","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1137\/S1052623494278827","volume":"10","author":"MC Pullan","year":"2000","unstructured":"Pullan, M.C.: Convergence of a general class of algorithms for separated continuous linear programs. SIAM J. Optim. 10(3), 722\u2013731 (2000)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1539_CR27","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s10107-002-0307-0","volume":"93","author":"MC Pullan","year":"2002","unstructured":"Pullan, M.C.: An extended algorithm for separated continuous linear programs. Math. Program. 93(3), 415\u2013451 (2002)","journal-title":"Math. Program."},{"key":"1539_CR28","volume-title":"Introduction to Probability Models","author":"SM Ross","year":"2010","unstructured":"Ross, S.M.: Introduction to Probability Models, 10th edn. Elsevier, Burlington (2010)","edition":"10"},{"key":"1539_CR29","volume-title":"Principles of Mathematical Analysis","author":"W Rudin","year":"1976","unstructured":"Rudin, W.: Principles of Mathematical Analysis, 3rd edn. McGraw-Hill, New York (1976)","edition":"3"},{"issue":"5","key":"1539_CR30","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster, A.L.: Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper. Res. 21(5), 1154\u20131157 (1973)","journal-title":"Oper. Res."},{"issue":"3","key":"1539_CR31","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1137\/0113043","volume":"13","author":"WF Tyndall","year":"1965","unstructured":"Tyndall, W.F.: A duality theorem for a class of continuous linear programming problems. SIAM J. Appl. Math. 13(3), 644\u2013666 (1965)","journal-title":"SIAM J. Appl. Math."},{"issue":"5","key":"1539_CR32","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1137\/0115112","volume":"15","author":"WF Tyndall","year":"1967","unstructured":"Tyndall, W.F.: An extended duality theorem for continuous linear programming problems. SIAM J. Appl. Math. 15(5), 1294\u20131298 (1967)","journal-title":"SIAM J. Appl. Math."},{"issue":"1","key":"1539_CR33","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10107-008-0217-x","volume":"115","author":"G Weiss","year":"2008","unstructured":"Weiss, G.: A simplex based algorithm to solve separated continuous linear programs. Math. Program. 115(1), 151\u2013198 (2008)","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01539-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-020-01539-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-020-01539-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,2]],"date-time":"2021-02-02T01:16:49Z","timestamp":1612228609000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-020-01539-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,3]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["1539"],"URL":"https:\/\/doi.org\/10.1007\/s11590-020-01539-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2020,2,3]]},"assertion":[{"value":"6 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}