{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T09:40:28Z","timestamp":1742377228764,"version":"3.40.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T00:00:00Z","timestamp":1739836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board, India","doi-asserted-by":"crossref","award":["CRG\/2022\/001347"],"award-info":[{"award-number":["CRG\/2022\/001347"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001412","name":"CSIR, India","doi-asserted-by":"crossref","award":["File No. 09\/1217(13822)\/2022-EMR-I"],"award-info":[{"award-number":["File No. 09\/1217(13822)\/2022-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001072"],"award-info":[{"award-number":["12001072"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012669","name":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission","doi-asserted-by":"publisher","award":["CSTB2022NSCQMSX1318"],"award-info":[{"award-number":["CSTB2022NSCQMSX1318"]}],"id":[{"id":"10.13039\/501100012669","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1007\/s10957-025-02626-3","type":"journal-article","created":{"date-parts":[[2025,2,18]],"date-time":"2025-02-18T23:08:41Z","timestamp":1739920121000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Method for Uncertain Linear Optimization Problems Through Polytopic Approximation of the Uncertainty Set"],"prefix":"10.1007","volume":"205","author":[{"given":"Ravi","family":"Raushan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debdas","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9688-2276","authenticated-orcid":false,"given":"Yong","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Wei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,18]]},"reference":[{"issue":"16","key":"2626_CR1","doi-asserted-by":"publisher","first-page":"4341","DOI":"10.1093\/imrn\/rnt078","volume":"2014","author":"A Barvinok","year":"2014","unstructured":"Barvinok, A.: Thrifty approximations of convex bodies by polytopes. Int. Math. Res. Not. 2014(16), 4341\u20134356 (2014)","journal-title":"Int. Math. Res. Not."},{"key":"2626_CR2","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust Optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton University Press, Princeton (2009)"},{"issue":"4","key":"2626_CR3","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust convex optimization. Math. Oper. Res. 23(4), 769\u2013805 (1998)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"2626_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"key":"2626_CR5","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on Modern Convex Optimization\u2014Analysis, Algorithms, and Engineering Applications","author":"A Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization\u2014Analysis, Algorithms, and Engineering Applications. SIAM, Philadelphia (2001)"},{"issue":"2","key":"2626_CR6","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(2), 351\u2013376 (2004)","journal-title":"Math. Program."},{"key":"2626_CR7","volume-title":"Convex Optimization Algorithms","author":"DP Bertsekas","year":"2015","unstructured":"Bertsekas, D.P.: Convex Optimization Algorithms. Athena Scientific, Nashua (2015)"},{"issue":"1","key":"2626_CR8","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1287\/opre.1090.0715","volume":"58","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O., Teo, K.M.: Robust optimization for unconstrained simulation-based problems. Oper. Res. 58(1), 161\u2013178 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"2626_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."},{"issue":"6","key":"2626_CR10","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1007\/s10958-008-9144-x","volume":"153","author":"EM Bronstein","year":"2008","unstructured":"Bronstein, E.M.: Approximation of convex sets by polytopes. J. Math. Sci. 153(6), 727\u2013762 (2008)","journal-title":"J. Math. Sci."},{"issue":"3","key":"2626_CR11","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/BF02275347","volume":"89","author":"AS El-Bakry","year":"1996","unstructured":"El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y.: On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89(3), 507\u2013541 (1996)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"2626_CR12","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/S0895479896298130","volume":"18","author":"L El Ghaoui","year":"1997","unstructured":"El Ghaoui, L., Lebret, H.: Robust solutions to least-squares problems with uncertain data. SIAM J. Matrix Anal. Appl. 18(4), 1035\u20131064 (1997)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"2626_CR13","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1052623496305717","volume":"9","author":"L El Ghaoui","year":"1998","unstructured":"El Ghaoui, L., Oustry, F., Lebret, H.: Robust solutions to uncertain semidefinite programs. SIAM J. Optim. 9(1), 33\u201352 (1998)","journal-title":"SIAM J. Optim."},{"key":"2626_CR14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971316","volume-title":"Nonlinear Programming\u2014Sequential Unconstrained Minimization Techniques","author":"AV Fiacco","year":"1990","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming\u2014Sequential Unconstrained Minimization Techniques. SIAM, Philadelphia (1990)"},{"key":"2626_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2017\/5137317","volume":"2017","author":"J Garc\u00eda","year":"2017","unstructured":"Garc\u00eda, J., Pope, C., Altimiras, F.: A distributed k-means segmentation algorithm applied to Lobesia botrana recognition. Complexity 2017, 1\u201314 (2017)","journal-title":"Complexity"},{"issue":"1","key":"2626_CR16","first-page":"81","volume":"9","author":"D Ghosh","year":"2023","unstructured":"Ghosh, D., Kishor, N., Zhao, X.: A Newton method for uncertain multiobjective optimization problems with finite uncertainty Set. J. Nonlinear Var. Anal. 9(1), 81\u2013110 (2023)","journal-title":"J. Nonlinear Var. Anal."},{"key":"2626_CR17","doi-asserted-by":"publisher","DOI":"10.1080\/0305215X.2024.2418341","author":"D Ghosh","year":"2024","unstructured":"Ghosh, D., Kishor, N.: Generalized ordered weighted aggregation robustness: A new robust counterpart to solve uncertain multi-objective optimization problems. Optim. Eng. (2024). https:\/\/doi.org\/10.1080\/0305215X.2024.2418341","journal-title":"Optim. Eng."},{"key":"2626_CR18","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-319-26401-1_45","volume-title":"Ubiquitous Computing and Ambient Intelligence. Sensing, Processing, and Using Environmental Information","author":"E Graells-Garrido","year":"2015","unstructured":"Graells-Garrido, E., Garc\u00eda, J.: Visual Exploration of Urban Dynamics Using Mobile Data. In: Garc\u00eda-Chamizo, J.M., Fortino, G., Ochoa, S.F. (eds.) Ubiquitous Computing and Ambient Intelligence. Sensing, Processing, and Using Environmental Information, pp. 480\u2013491. Springer International Publishing, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26401-1_45"},{"issue":"7","key":"2626_CR19","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.3390\/s16071098","volume":"16","author":"E Graells-Garrido","year":"2016","unstructured":"Graells-Garrido, E., Peredo, O., Garc\u00eda, J.: Sensing urban patterns with antenna mappings\u2014the case of Santiago. Chile. Sens. 16(7), 1098 (2016)","journal-title":"Chile. Sens."},{"key":"2626_CR20","volume-title":"Handbook of Convex Geometry","author":"PM Gruber","year":"1993","unstructured":"Gruber, P.M., Wills, J.M.: Handbook of Convex Geometry, vol. B. Elsevier, North Holland (1993)"},{"issue":"3","key":"2626_CR21","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/0377-2217(94)00092-Q","volume":"86","author":"M Inuiguchi","year":"1995","unstructured":"Inuiguchi, M., Sakawa, M.: Minimax regret solution to linear programming problems with an interval objective function. Eur. J. Oper. Res. 86(3), 526\u2013536 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"2626_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106236","volume":"155","author":"D Ghosh","year":"2023","unstructured":"Ghosh, D., Ansari, Q.H., Ehrgott, M., Upadhayay, A.: An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems. Comput. Oper. Res. 155, 106236 (2023)","journal-title":"Comput. Oper. Res."},{"key":"2626_CR23","doi-asserted-by":"crossref","unstructured":"Karmarkar, N.: A new polynomial-time algorithm for linear programming. In: Proceedings of the sixteenth annual ACM symposium on Theory of Computing - STOC\u2019 84, pp. 302\u2013311. ACMPress, New York (1984) https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/800057.808695","DOI":"10.1145\/800057.808695"},{"issue":"5","key":"2626_CR24","first-page":"1093","volume":"244","author":"LG Khachiyan","year":"1979","unstructured":"Khachiyan, L.G.: A polynomial algorithm in linear programming. Soviet Math. Doklady 244(5), 1093\u20131096 (1979)","journal-title":"Soviet Math. Doklady"},{"key":"2626_CR25","unstructured":"Kishor, N., Ghosh, D., Zhao, X.: Generalized ordered weighted aggregation robustness to solve uncertain single objective optimization problems. (2024) arXiv:2410.03222"},{"issue":"2","key":"2626_CR26","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/j.ejor.2016.12.045","volume":"260","author":"K Klamroth","year":"2017","unstructured":"Klamroth, K., K\u00f6bis, E., Sch\u00f6bel, A., Tammer, C.: A unified approach to uncertain optimization. Eur. J. Oper. Res. 260(2), 403\u2013420 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2626_CR27","first-page":"159","volume":"3","author":"V Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm? Inequalities 3(3), 159\u2013175 (1972)","journal-title":"Inequalities"},{"issue":"2","key":"2626_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/j.disopt.2004.07.003","volume":"1","author":"M Kochol","year":"2004","unstructured":"Kochol, M.: A note on approximation of a ball by polytopes. Discrete Optim. 1(2), 229\u2013231 (2004)","journal-title":"Discrete Optim."},{"key":"2626_CR29","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF01582151","volume":"61","author":"M Kojima","year":"1993","unstructured":"Kojima, M., Megiddo, N., Mizuno, S.: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61, 263\u2013280 (1993)","journal-title":"Math. Program."},{"key":"2626_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/BF01588785","volume":"49","author":"IJ Lustig","year":"1990","unstructured":"Lustig, I.J.: Feasibility issues in a primal-dual interior-point method for linear programming. Math. Program. 49, 145\u2013162 (1990)","journal-title":"Math. Program."},{"issue":"3","key":"2626_CR31","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1353\/ajm.2020.0018","volume":"142","author":"M Nasz\u00f3di","year":"2020","unstructured":"Nasz\u00f3di, M., Nazarov, F., Ryabogin, D.: Fine approximation of convex bodies by polytopes. Am. J. Math. 142(3), 809\u2013820 (2020)","journal-title":"Am. J. Math."},{"key":"2626_CR32","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/978-3-319-46819-8_66","volume-title":"Geostatistics Valencia 2016","author":"OF Peredo","year":"2017","unstructured":"Peredo, O.F., Garc\u00eda, J.A., Stuven, R., Ortiz, J.M.: Urban Dynamic Estimation Using Mobile Phone Logs and Locally Varying Anisotropy. In: G\u00f3mez-Hern\u00e1ndez, J.J., Rodrigo-Ilarri, J., Rodrigo-Clavero, M.E., Cassiraga, E., Vargas-Guzm\u00e1n, J.A. (eds.) Geostatistics Valencia 2016, pp. 949\u2013964. Springer International Publishing, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-46819-8_66"},{"issue":"2","key":"2626_CR33","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00186-014-0474-9","volume":"80","author":"A Sch\u00f6bel","year":"2014","unstructured":"Sch\u00f6bel, A.: Generalized light robustness and the trade-off between robustness and nominal quality. Math. Oper. Res. 80(2), 161\u2013191 (2014)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"2626_CR34","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."},{"key":"2626_CR35","unstructured":"Tanabe, K.: Centered Newton method for linear programming: Interior and \u201cexterior\" point method. In: Tone, K., (ed.): New Methods for Linear Programming, The Institute of Statistical Mathematics, Tokyo, Japan, vol. 19, pp. 98\u2013100. Japan (1990)"},{"key":"2626_CR36","unstructured":"Terlaky, T.: Interior Point Methods of Mathematical Programming. Springer Science & Business Media, (2013)"},{"issue":"3","key":"2626_CR37","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1007\/s11081-022-09747-y","volume":"24","author":"A Upadhayay","year":"2023","unstructured":"Upadhayay, A., Ghosh, D., Ansari, Q.H.: Jauny: augmented Lagrangian cone method for multiobjective optimization problems with an application to an optimal control problem. Optim. Eng. 24(3), 1633\u20131665 (2023)","journal-title":"Optim. Eng."},{"key":"2626_CR38","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-030-39415-8_12","volume-title":"Linear Programming: Foundations and Extensions","author":"RJ Vanderbei","year":"2020","unstructured":"Vanderbei, R.J.: Data Science Applications. In: Linear Programming: Foundations and Extensions, pp. 187\u2013213. Springer International Publishing, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39415-8_12"},{"key":"2626_CR39","volume-title":"Linear Programming\u2014Foundations and Extensions","author":"RJ Vanderbei","year":"2008","unstructured":"Vanderbei, R.J.: Linear Programming\u2014Foundations and Extensions. Springer, New York (2008)"},{"key":"2626_CR40","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1023\/A:1008677427361","volume":"13","author":"RJ Vanderbei","year":"1999","unstructured":"Vanderbei, R.J., Shanno, D.F.: An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231\u2013252 (1999)","journal-title":"Comput. Optim. Appl."},{"key":"2626_CR41","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10898-023-01286-9","volume":"87","author":"H Wu","year":"2023","unstructured":"Wu, H., Luo, H., Zhang, X., Qi, H.: An effective global algorithm for worst-case linear optimization under polyhedral uncertainty. J. Glob. Optim. 87, 191\u2013219 (2023)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"2626_CR42","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1137\/0804012","volume":"4","author":"Y Zhang","year":"1994","unstructured":"Zhang, Y.: On the convergence of a class of infeasible interior-point methods for the horizontal linear complementarity problem. SIAM J. Optim. 4(1), 208\u2013227 (1994)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02626-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-025-02626-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-025-02626-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T08:42:58Z","timestamp":1742373778000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-025-02626-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,2,18]]},"references-count":42,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,4]]}},"alternative-id":["2626"],"URL":"https:\/\/doi.org\/10.1007\/s10957-025-02626-3","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2025,2,18]]},"assertion":[{"value":"30 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest. The authors do not have any conflict of interest or conflict of interest to declare. They also do not have any funding conflicts to declare.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not involve any human and\/or animal studies.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethicsal Approval"}},{"value":"Not applicable to this article.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}}],"article-number":"14"}}