{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T06:48:43Z","timestamp":1763794123122,"version":"3.45.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:00:00Z","timestamp":1761004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T00:00:00Z","timestamp":1761004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,11]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    This paper presents a robust framework for handling a\n                    <jats:italic>conic multiobjective<\/jats:italic>\n                    linear optimization problem, where the objective and constraint functions are involving affinely parameterized data uncertainties. More precisely, we examine optimality conditions and calculate efficient solutions of the conic robust multiobjective linear problem. We provide necessary and sufficient linear conic criteria for efficiency of the underlying conic robust multiobjective linear program. It is shown that such optimality conditions can be expressed in terms of linear matrix inequalities and second-order conic conditions for a multiobjective semidefinite program and a multiobjective second order conic program, respectively. We show how efficient solutions of the conic robust multiobjective linear problem can be found via its conic programming reformulation problems including semidefinite programming and second-order cone programming problems. Numerical examples are also provided to illustrate that the proposed conic programming reformulation schemes can be employed to find efficient solutions for concrete problems including those arisen from practical applications.\n                  <\/jats:p>","DOI":"10.1007\/s10898-025-01552-y","type":"journal-article","created":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T07:54:35Z","timestamp":1761033275000},"page":"747-776","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimality and solutions for conic robust multiobjective programs"],"prefix":"10.1007","volume":"93","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0893-5604","authenticated-orcid":false,"given":"Thai Doan","family":"Chuong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinghuo","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Eberhard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chaojie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,21]]},"reference":[{"key":"1552_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ejor.2014.03.013","volume":"239","author":"M Ehrgott","year":"2014","unstructured":"Ehrgott, M., Ide, J., Schobel, A.: Minmax robustness for multi-objective optimization problems, European. J Oper. Res. 239, 17\u201331 (2014)","journal-title":"J Oper. Res."},{"key":"1552_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08900-3","volume-title":"Vector optimization and monotone operators via convex duality","author":"SM Grad","year":"2015","unstructured":"Grad, S.M.: Vector optimization and monotone operators via convex duality. Recent advances. Vector Optimization. Springer, Cham (2015)"},{"key":"1552_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24828-6","volume-title":"Vector Optimization: Theory, Applications, and Extensions","author":"J Jahn","year":"2004","unstructured":"Jahn, J.: Vector Optimization: Theory, Applications, and Extensions. Springer-Verlag, Berlin (2004)"},{"doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications. Philadelphia: SIAM, (2001)","key":"1552_CR4","DOI":"10.1137\/1.9780898718829"},{"key":"1552_CR5","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, NJ, Princeton Ser. Appl. Math. (2009)"},{"issue":"1\u20132","key":"1552_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10107-014-0750-8","volume":"149","author":"A Ben-Tal","year":"2015","unstructured":"Ben-Tal, A., den Hertog, D., Vial, J.-P.: Deriving robust counterparts of nonlinear uncertain inequalities. Math. Program. 149(1\u20132), 265\u2013299 (2015). (Ser. A)","journal-title":"Math. Program."},{"key":"1552_CR7","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, 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"key":"1552_CR8","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. SIAM Publications, Philadelphia (2012)"},{"key":"1552_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"6","key":"1552_CR10","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.orl.2017.09.002","volume":"45","author":"TD Chuong","year":"2017","unstructured":"Chuong, T.D.: Robust alternative theorem for linear inequalities with applications to robust multi-objective optimization. Oper. Res. Lett. 45(6), 575\u2013580 (2017)","journal-title":"Oper. Res. Lett."},{"key":"1552_CR11","doi-asserted-by":"publisher","first-page":"2466","DOI":"10.1137\/17M1143484","volume":"28","author":"TD Chuong","year":"2018","unstructured":"Chuong, T.D.: Linear matrix inequality conditions and duality for a class of robust multi-objective convex polynomial programs. SIAM J. Optim. 28, 2466\u20132488 (2018)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1552_CR12","doi-asserted-by":"publisher","first-page":"1501","DOI":"10.1137\/19M1251461","volume":"30","author":"TD Chuong","year":"2020","unstructured":"Chuong, T.D.: Robust optimality and duality in multiobjective optimization problems under data uncertainty. SIAM J. Optim. 30(2), 1501\u20131526 (2020)","journal-title":"SIAM J. Optim."},{"key":"1552_CR13","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s10479-022-05104-5","volume":"346","author":"TD Chuong","year":"2025","unstructured":"Chuong, T.D., Jeyakumar, V.: Adjustable robust multi-objective linear optimization: Pareto optimal solutions via conic programming. Ann. Oper. Res. 346, 895\u2013916 (2025)","journal-title":"Ann. Oper. Res."},{"key":"1552_CR14","doi-asserted-by":"publisher","first-page":"1533","DOI":"10.1007\/s10479-021-04461-x","volume":"319","author":"TD Chuong","year":"2022","unstructured":"Chuong, T.D., Mak-Hau, V.H., Yearwood, J., Dazeley, R., Nguyen, M.-T., Cao, T.: Robust Pareto solutions for convex quadratic multiobjective optimization problems under data uncertainty. Ann. Oper. Res. 319, 1533\u20131564 (2022)","journal-title":"Ann. Oper. Res."},{"key":"1552_CR15","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/s10479-017-2751-5","volume":"271","author":"EK Doolittle","year":"2018","unstructured":"Doolittle, E.K., Kerivin, H.L.M., Wiecek, M.M.: Robust multiobjective optimization problem with application to internet routing. Ann. Oper. Res. 271, 487\u2013525 (2018)","journal-title":"Ann. Oper. Res."},{"key":"1552_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100021","volume":"9","author":"M Dur","year":"2021","unstructured":"Dur, M., Rendl, F.: Conic optimization: A survey with special focus on copositive optimization and binary quadratic problems. EURO J. Comput. Optim. 9, 100021 (2021)","journal-title":"EURO J. Comput. Optim."},{"key":"1552_CR17","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Berlin (2005)"},{"key":"1552_CR18","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.ejor.2019.08.040","volume":"281","author":"A Engau","year":"2020","unstructured":"Engau, A., Devon, S.: Pareto solutions in multicriteria optimization under uncertainty, European. J Oper. Res. 281, 357\u2013368 (2020)","journal-title":"J Oper. Res."},{"issue":"2","key":"1552_CR19","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/s10898-017-0518-9","volume":"69","author":"G Eichfelder","year":"2017","unstructured":"Eichfelder, G., Gabriele, C., Kruger, A.: Schobel, Decision uncertainty in multiobjective optimization. J. Global Optim. 69(2), 485\u2013510 (2017)","journal-title":"J. Global Optim."},{"issue":"1","key":"1552_CR20","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ejor.2013.02.037","volume":"229","author":"PG Georgiev","year":"2013","unstructured":"Georgiev, P.G., Luc, D.T., Pardalos, P.M.: Robust aspects of solutions in deterministic multiple objective linear programming. European J. Oper. Res. 229(1), 29\u201336 (2013)","journal-title":"European J. Oper. Res."},{"key":"1552_CR21","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.ejor.2018.03.018","volume":"242","author":"MA Goberna","year":"2018","unstructured":"Goberna, M.A., Jeyakumar, V., Li, G., Vicente-Perez, J.: Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs, European. J Oper. Res. 242, 40\u201350 (2018)","journal-title":"J Oper. Res."},{"issue":"3","key":"1552_CR22","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1016\/j.ejor.2014.10.027","volume":"242","author":"MA Goberna","year":"2015","unstructured":"Goberna, M.A., Jeyakumar, V., Li, G., Vicente-Perez, J.: Robust solutions to multi-objective linear programs with uncertain data. European J. Oper. Res. 242(3), 730\u2013743 (2015)","journal-title":"European J. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Grant, M., Boyd, S.: Graph implementations for nonsmooth convex programs. In V. Blondel, S. Boyd, and H. Kimura, editors, Recent Advances in Learning and Control, Lecture Notes in Control and Information Sciences, pages 95\u2013110. Springer, (2008)","key":"1552_CR23","DOI":"10.1007\/978-1-84800-155-8_7"},{"key":"1552_CR24","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00291-015-0418-7","volume":"38","author":"J Ide","year":"2016","unstructured":"Ide, J., Sch\u00f6bel, A.: Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts. OR Spectrum 38, 235\u2013271 (2016)","journal-title":"OR Spectrum"},{"issue":"2\u20133","key":"1552_CR25","first-page":"305","volume":"40","author":"D Kuroiwa","year":"2012","unstructured":"Kuroiwa, D., Lee, G.M.: On robust multi-objective optimization. Vietnam J. Math. 40(2\u20133), 305\u2013317 (2012)","journal-title":"Vietnam J. Math."},{"key":"1552_CR26","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/s10479-019-03216-z","volume":"296","author":"JH Lee","year":"2021","unstructured":"Lee, J.H., Jiao, L.: Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data. Ann. Oper. Res. 296, 803\u2013820 (2021)","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"1552_CR27","first-page":"1263","volume":"22","author":"JH Lee","year":"2021","unstructured":"Lee, J.H., Jiao, L.: Robust multi-objective optimization with SOS-convex polynomials over a polynomial matrix inequality. J. Nonlinear Convex Anal. 22(7), 1263\u20131284 (2021)","journal-title":"J. Nonlinear Convex Anal."},{"key":"1552_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-50280-4","volume-title":"Theory of Vector Optimization","author":"DT Luc","year":"1989","unstructured":"Luc, D.T.: Theory of Vector Optimization. Lecture Notes in Economics and Mathematical Systems. Berlin, Springer (1989)"},{"key":"1552_CR29","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.compchemeng.2016.11.038","volume":"102","author":"DE Majewski","year":"2017","unstructured":"Majewski, D.E., Wirtz, M., Lampe, M., Bardow, A.: Robust multi-objective optimization for sustainable design of distributed energy supply systems. Comput. Chem. Eng. 102, 26\u201339 (2017)","journal-title":"Comput. Chem. Eng."},{"key":"1552_CR30","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, N.M.: An easy path to convex analysis and applications, Synthesis Lectures on Mathematics and Statistics, 14. Morgan & Claypool Publishers, Williston (2014)"},{"issue":"2","key":"1552_CR31","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1080\/10556789208805510","volume":"1","author":"Y Nesterov","year":"1992","unstructured":"Nesterov, Y., Nemirovski, A.: Conic formulation of a convex programming problem and duality. Optim. Methods Softw. 1(2), 95\u2013115 (1992)","journal-title":"Optim. Methods Softw."},{"key":"1552_CR32","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1016\/j.ijepes.2019.05.023","volume":"113","author":"M Shafiekhani","year":"2019","unstructured":"Shafiekhani, M., Badri, A., Shafie-Khah, M., Catal\u00e3o, J.: Strategic Bidding of Virtual Power Plant in Energy Markets: A Bi-Level Multi-Objective Approach. International Journal of Electrical Power & Energy Systems 113, 208\u201319 (2019)","journal-title":"International Journal of Electrical Power & Energy Systems"},{"key":"1552_CR33","doi-asserted-by":"publisher","first-page":"171","DOI":"10.2140\/pjm.1958.8.171","volume":"8","author":"M Sion","year":"1958","unstructured":"Sion, M.: On general minimax theorems. Pacific J. Math. 8, 171\u2013176 (1958)","journal-title":"Pacific J. Math."},{"doi-asserted-by":"crossref","unstructured":"Wiecek, M. M., Dranichak, G. M.: Robust multi-objective optimization for decision making under uncertainty and conflict. In A. Gupta and A. Capponi (Eds.), TutORials in operations research, optimization challenges in complex, networked, and risky systems (pp. 84\u2013114). INFORMS, (2016)","key":"1552_CR34","DOI":"10.1287\/educ.2016.0153"},{"issue":"2","key":"1552_CR35","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1016\/j.ejor.2015.06.031","volume":"247","author":"M Zamani","year":"2015","unstructured":"Zamani, M., Soleimani-damaneh, M., Kabgani, A.: Robustness in nonsmooth nonlinear multi-objective programming. European J. Oper. Res. 247(2), 370\u2013378 (2015)","journal-title":"European J. Oper. Res."},{"key":"1552_CR36","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."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01552-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-025-01552-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-025-01552-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,22]],"date-time":"2025-11-22T06:45:33Z","timestamp":1763793933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-025-01552-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,21]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["1552"],"URL":"https:\/\/doi.org\/10.1007\/s10898-025-01552-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2025,10,21]]},"assertion":[{"value":"12 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}