{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T14:00:48Z","timestamp":1778853648253,"version":"3.51.4"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T00:00:00Z","timestamp":1660608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T00:00:00Z","timestamp":1660608000000},"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":["Nat Comput"],"published-print":{"date-parts":[[2023,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This work aims at reviewing the state of the art of the field of lexicographic multi\/many-objective optimization. The discussion starts with a review of the literature, emphasizing the numerous application in the real life and the recent burst received by the advent of new computational frameworks which work well in such contexts, e.g., Grossone Methodology. Then the focus shifts on a new class of problems proposed and studied for the first time only recently: the priority-levels mixed-pareto-lexicographic multi-objective-problems (PL-MPL-MOPs). This class of programs preserves the original preference ordering of pure many-objective lexicographic optimization, but instantiates it over multi-objective problems rather than scalar ones. Interestingly, PL-MPL-MOPs seem to be very well qualified for modeling real world tasks, such as the design of either secure or fast vehicles. The work also describes the implementation of an evolutionary algorithm able to solve PL-MPL-MOPs, and reports its performance when compared against other popular optimizers.<\/jats:p>","DOI":"10.1007\/s11047-022-09911-4","type":"journal-article","created":{"date-parts":[[2022,8,16]],"date-time":"2022-08-16T08:03:50Z","timestamp":1660637030000},"page":"227-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Pure and mixed lexicographic-paretian many-objective optimization: state of the art"],"prefix":"10.1007","volume":"22","author":[{"given":"Leonardo","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5413-0148","authenticated-orcid":false,"given":"Lorenzo","family":"Fiaschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Cococcioni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kalyanmoy","family":"Deb","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,16]]},"reference":[{"issue":"3","key":"9911_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF01919766","volume":"21","author":"FA Behringer","year":"1977","unstructured":"Behringer FA (1977) Lexicographic quasiconcave multiobjective programming. Z Oper Res 21(3):103\u2013116. https:\/\/doi.org\/10.1007\/BF01919766","journal-title":"Z Oper Res"},{"issue":"5","key":"9911_CR2","doi-asserted-by":"publisher","first-page":"1673","DOI":"10.3934\/dcdss.2020449","volume":"14","author":"V Benci","year":"2021","unstructured":"Benci V, Cococcioni M (2021) The algorithmic numbers in non-archimedean numerical computing environments. Discr Contin Dyn Syst S 14(5):1673. https:\/\/doi.org\/10.3934\/dcdss.2020449","journal-title":"Discr Contin Dyn Syst S"},{"key":"9911_CR3","doi-asserted-by":"publisher","first-page":"89,497","DOI":"10.1109\/ACCESS.2020.2990567","volume":"8","author":"J Blank","year":"2020","unstructured":"Blank J, Deb K (2020) Pymoo: multi-objective optimization in python. IEEE Access 8:89,497-89,509. https:\/\/doi.org\/10.1109\/ACCESS.2020.2990567","journal-title":"IEEE Access"},{"key":"9911_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88908-3_6","author":"J Branke","year":"2008","unstructured":"Branke J (2008) Consideration of partial user preferences in evolutionary multiobjective optimization. Multiobject Optim. https:\/\/doi.org\/10.1007\/978-3-540-88908-3_6","journal-title":"Multiobject Optim"},{"issue":"3","key":"9911_CR5","doi-asserted-by":"publisher","first-page":"205","DOI":"10.32479\/ijeep.7574","volume":"9","author":"EO Camargo","year":"2019","unstructured":"Camargo EO, Candelo JE, Mercado AS (2019) Lexicographic multi-objective optimisation of hybrid power generation systems for communities in non-interconnected zones. Int J Energy Econ Policy 9(3):205. https:\/\/doi.org\/10.32479\/ijeep.7574","journal-title":"Int J Energy Econ Policy"},{"key":"9911_CR6","unstructured":"Castro-Guti\u00e9rrez J, Landa-Silva D, Moreno-P\u00e9rez J (2009) Dynamic lexicographic approach for heuristic multi-objective optimization. In: Proceedings of the Workshop on Intelligent Metaheuristics for Logistic Planning (CAEPIA-TTIA 2009), Seville, Spain, pp 153\u2013163"},{"issue":"1","key":"9911_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s40747-017-0039-7","volume":"3","author":"R Cheng","year":"2017","unstructured":"Cheng R, Li M, Tian Y et al (2017) A benchmark test suite for evolutionary many-objective optimization. Complex Intell Syst 3(1):67\u201381. https:\/\/doi.org\/10.1007\/s40747-017-0039-7","journal-title":"Complex Intell Syst"},{"issue":"7","key":"9911_CR8","doi-asserted-by":"publisher","first-page":"2455","DOI":"10.1007\/s11590-020-01644-6","volume":"15","author":"M Cococcioni","year":"2021","unstructured":"Cococcioni M, Fiaschi L (2021) The Big-M method with the numerical infinite $$M$$. Optim Lett 15(7):2455\u20132468. https:\/\/doi.org\/10.1007\/s11590-020-01644-6","journal-title":"Optim Lett"},{"key":"9911_CR9","doi-asserted-by":"publisher","unstructured":"Cococcioni M, Pappalardo M, Sergeyev Y (2016) Towards lexicographic multi-objective linear programming using grossone methodology. In: Sergeyev Y, Kvasov D, Dell\u2019Accio F, et\u00a0al (eds.) Proceedings of the 2nd Internetional Conferemce \u201cNumerical Computations: Theory and Algorithms\u201d, vol 1776. AIP Publishing, New York, p 090040, https:\/\/doi.org\/10.1063\/1.4965404","DOI":"10.1063\/1.4965404"},{"key":"9911_CR10","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.amc.2017.05.058","volume":"318","author":"M Cococcioni","year":"2018","unstructured":"Cococcioni M, Pappalardo M, Sergeyev YD (2018) Lexicographic multi-objective linear programming using grossone methodology: theory and algorithm. Appl Math Comput 318:298\u2013311. https:\/\/doi.org\/10.1016\/j.amc.2017.05.058","journal-title":"Appl Math Comput"},{"issue":"105","key":"9911_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.cnsns.2020.105177","volume":"84","author":"M Cococcioni","year":"2020","unstructured":"Cococcioni M, Cudazzo A, Pappalardo M et al (2020) Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology. Commun Nonlinear Sci Numer Simul 84(105):177. https:\/\/doi.org\/10.1016\/j.cnsns.2020.105177","journal-title":"Commun Nonlinear Sci Numer Simul"},{"issue":"113","key":"9911_CR12","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/j.cam.2021.113483","volume":"393","author":"M Cococcioni","year":"2021","unstructured":"Cococcioni M, Fiaschi L, Lambertini L (2021) Non-archimedean zero-sum games. J Comput Appl Math 393(113):483. https:\/\/doi.org\/10.1016\/j.cam.2021.113483","journal-title":"J Comput Appl Math"},{"key":"9911_CR13","unstructured":"Dantzig GB (1948) Programming in a linear structure. In: Bulletin of the American Mathematical Society, American Mathematical Society, 201 Charles St., Providence, RI 02940-2213, pp 1074\u20131074"},{"issue":"2","key":"9911_CR14","doi-asserted-by":"publisher","first-page":"183","DOI":"10.2140\/pjm.1955.5.183","volume":"5","author":"GB Dantzig","year":"1955","unstructured":"Dantzig GB, Orden A, Wolfe P et al (1955) The generalized simplex method for minimizing a linear form under linear inequality restraints. Pac J Math 5(2):183\u2013195. https:\/\/doi.org\/10.2140\/pjm.1955.5.183","journal-title":"Pac J Math"},{"issue":"5","key":"9911_CR15","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1109\/TKDE.2019.2894148","volume":"32","author":"S Datta","year":"2019","unstructured":"Datta S, Nag S, Das S (2019) Boosting with lexicographic programming: addressing class imbalance without cost tuning. IEEE Trans Knowl Data Eng 32(5):883\u2013897. https:\/\/doi.org\/10.1109\/TKDE.2019.2894148","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"16","key":"9911_CR16","doi-asserted-by":"publisher","first-page":"8029","DOI":"10.1016\/j.amc.2011.07.042","volume":"218","author":"S De Cosmis","year":"2012","unstructured":"De Cosmis S, De Leone R (2012) The use of grossone in mathematical programming and operations research. Appl Math Comput 218(16):8029\u20138038. https:\/\/doi.org\/10.1016\/j.amc.2011.07.042","journal-title":"Appl Math Comput"},{"key":"9911_CR17","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.amc.2017.03.029","volume":"318","author":"R De Leone","year":"2018","unstructured":"De Leone R (2018) Nonlinear programming and grossone: quadratic programing and the role of constraint qualifications. Appl Math Comput 318:290\u2013297. https:\/\/doi.org\/10.1016\/j.amc.2017.03.029","journal-title":"Appl Math Comput"},{"issue":"2","key":"9911_CR18","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/s10957-020-01717-7","volume":"186","author":"R De Leone","year":"2020","unstructured":"De Leone R, Fasano G, Roma M et al (2020) Iterative grossone-based computation of negative curvature directions in large-scale optimization. J Optim Theory Appl 186(2):554\u2013589. https:\/\/doi.org\/10.1007\/s10957-020-01717-7","journal-title":"J Optim Theory Appl"},{"key":"9911_CR19","unstructured":"Deb K (2001) Multi-objective optimization using evolutionary algorithms. Wiley, USA, https:\/\/dl.acm.org\/doi\/10.5555\/559152"},{"issue":"4","key":"9911_CR20","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","volume":"18","author":"K Deb","year":"2014","unstructured":"Deb K, Jain H (2014) An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: Solving problems with box constraints. IEEE Trans Evol Comput 18(4):577\u2013601. https:\/\/doi.org\/10.1109\/TEVC.2013.2281535","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9911_CR21","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S et al (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197. https:\/\/doi.org\/10.1109\/4235.996017","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9911_CR22","doi-asserted-by":"publisher","first-page":"678","DOI":"10.1109\/TCST.2015.2442838","volume":"24","author":"D Dueri","year":"2015","unstructured":"Dueri D, Leve F, A\u00e7\u0131kme\u015fe B (2015) Minimum error dissipative power reduction control allocation via lexicographic convex optimization for momentum control systems. IEEE Trans Control Syst Technol 24(2):678\u2013686. https:\/\/doi.org\/10.1109\/TCST.2015.2442838","journal-title":"IEEE Trans Control Syst Technol"},{"issue":"1","key":"9911_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.48550\/arXiv.1808.00738","volume":"14","author":"L Fiaschi","year":"2018","unstructured":"Fiaschi L, Cococcioni M (2018) Numerical asymptotic results in game theory using sergeyev\u2019s arithmetic of infinity. Int J Unconv Comput 14(1):1\u201325. https:\/\/doi.org\/10.48550\/arXiv.1808.00738","journal-title":"Int J Unconv Comput"},{"key":"9911_CR24","doi-asserted-by":"publisher","unstructured":"Fiaschi L, Cococcioni M (2020a) Generalizing Pure and Impure Iterated Prisoner\u2019s Dilemmas to the Case of Infinite and Infinitesimal Quantities. In: Sergeyev YD, Kvasov DE (eds.), Numerical Computations: Theory and Algorithms. Springer International Publishing, Cham, pp 370\u2013377, https:\/\/doi.org\/10.1007\/978-3-030-40616-5_32","DOI":"10.1007\/978-3-030-40616-5_32"},{"issue":"125","key":"9911_CR25","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.amc.2020.125356","volume":"409","author":"L Fiaschi","year":"2020","unstructured":"Fiaschi L, Cococcioni M (2020) Non-Archimedean game theory: a numerical approach. Appl Math Comput 409(125):356. https:\/\/doi.org\/10.1016\/j.amc.2020.125356","journal-title":"Appl Math Comput"},{"issue":"11","key":"9911_CR26","doi-asserted-by":"publisher","first-page":"1442","DOI":"10.1287\/mnsc.20.11.1442","volume":"20","author":"PC Fishburn","year":"1974","unstructured":"Fishburn PC (1974) Lexicographic orders, utilities and decision rules: a survey. Manag Sci 20(11):1442\u20131471. https:\/\/doi.org\/10.1287\/mnsc.20.11.1442","journal-title":"Manag Sci"},{"issue":"9","key":"9911_CR27","doi-asserted-by":"publisher","first-page":"1542","DOI":"10.1080\/0305215X.2019.1651310","volume":"52","author":"A Gaur","year":"2020","unstructured":"Gaur A, Khaled Talukder A, Deb K et al (2020) Unconventional optimization for achieving well-informed design solutions for the automobile industry. Eng Optim 52(9):1542\u20131560. https:\/\/doi.org\/10.1080\/0305215X.2019.1651310","journal-title":"Eng Optim"},{"issue":"3","key":"9911_CR28","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1016\/j.ejor.2011.09.017","volume":"218","author":"J Gondzio","year":"2012","unstructured":"Gondzio J (2012) Interior point methods 25 years later. Eur J Oper Res 218(3):587\u2013601. https:\/\/doi.org\/10.1016\/j.ejor.2011.09.017","journal-title":"Eur J Oper Res"},{"key":"9911_CR29","doi-asserted-by":"publisher","unstructured":"Haupt RL, Haupt SE (2003) Practical genetic algorithms. Wiley, https:\/\/doi.org\/10.1002\/0471671746","DOI":"10.1002\/0471671746"},{"issue":"4","key":"9911_CR30","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0305-0548(83)90003-5","volume":"10","author":"JP Ignizio","year":"1983","unstructured":"Ignizio JP (1983) Generalized goal programming an overview. Comput Oper Res 10(4):277\u2013289. https:\/\/doi.org\/10.1016\/0305-0548(83)90003-5","journal-title":"Comput Oper Res"},{"issue":"1","key":"9911_CR31","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/opre.22.1.189","volume":"22","author":"H Isermann","year":"1974","unstructured":"Isermann H (1974) Proper efficiency and the linear vector maximum problem. Oper Res 22(1):189\u2013191. https:\/\/doi.org\/10.1287\/opre.22.1.189","journal-title":"Oper Res"},{"issue":"4","key":"9911_CR32","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01782758","volume":"4","author":"H Isermann","year":"1982","unstructured":"Isermann H (1982) Linear lexicographic optimization. Oper Res Spektrum 4(4):223\u2013228. https:\/\/doi.org\/10.1007\/BF01782758","journal-title":"Oper Res Spektrum"},{"key":"9911_CR33","doi-asserted-by":"publisher","unstructured":"Ishibuchi H, Masuda H, Tanigaki Y, et\u00a0al (2015) Modified distance calculation in generational distance and inverted generational distance. In: Gaspar-Cunha A, Henggeler\u00a0Antunes C, Coello CC (eds) Evolutionary Multi-Criterion Optimization. Springer International Publishing, Cham, pp 110\u2013125, https:\/\/doi.org\/10.1007\/978-3-319-15892-1_8","DOI":"10.1007\/978-3-319-15892-1_8"},{"issue":"10","key":"9911_CR34","doi-asserted-by":"publisher","first-page":"1808","DOI":"10.1016\/j.automatica.2007.03.008","volume":"43","author":"CN Jones","year":"2007","unstructured":"Jones CN, Kerrigan EC, Maciejowski JM (2007) Lexicographic perturbation for multiparametric linear programming with applications to control. Automatica 43(10):1808\u20131816. https:\/\/doi.org\/10.1016\/j.automatica.2007.03.008","journal-title":"Automatica"},{"issue":"12","key":"9911_CR35","doi-asserted-by":"publisher","first-page":"9677","DOI":"10.1109\/TIE.2018.2821625","volume":"65","author":"S Khosravani","year":"2018","unstructured":"Khosravani S, Jalali M, Khajepour A et al (2018) Application of lexicographic optimization method to integrated vehicle control systems. IEEE Trans Ind Electron 65(12):9677\u20139686. https:\/\/doi.org\/10.1109\/TIE.2018.2821625","journal-title":"IEEE Trans Ind Electron"},{"issue":"100","key":"9911_CR36","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1016\/j.swevo.2020.100687","volume":"55","author":"L Lai","year":"2020","unstructured":"Lai L, Fiaschi L, Cococcioni M (2020) Solving mixed pareto-lexicographic multi-objective optimization problems: the case of priority chains. Swarm Evol Comput 55(100):687. https:\/\/doi.org\/10.1016\/j.swevo.2020.100687","journal-title":"Swarm Evol Comput"},{"key":"9911_CR37","doi-asserted-by":"publisher","unstructured":"Lai L, Fiaschi L, Cococcioni M, et\u00a0al (2020b) Handling priority levels in mixed pareto-lexicographic many-objective optimization problems. In: 11th Edition of International Conference Series on Evolutionary Multi-Criterion Optimization (EMO2021) https:\/\/doi.org\/10.1007\/978-3-030-72062-9_29","DOI":"10.1007\/978-3-030-72062-9_29"},{"key":"9911_CR38","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2021.3068816","author":"L Lai","year":"2021","unstructured":"Lai L, Fiaschi L, Cococcioni M et al (2021) Solving mixed pareto-lexicographic multi-objective optimization problems: the case of priority levels. IEEE Trans Evol Comput. https:\/\/doi.org\/10.1109\/TEVC.2021.3068816","journal-title":"IEEE Trans Evol Comput"},{"issue":"6","key":"9911_CR39","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s00158-007-0163-x","volume":"35","author":"X Liao","year":"2008","unstructured":"Liao X, Li Q, Yang X et al (2008) Multiobjective optimization for crash safety design of vehicles using stepwise regression model. Struct Multidiscip Optim 35(6):561\u2013569. https:\/\/doi.org\/10.1007\/s00158-007-0163-x","journal-title":"Struct Multidiscip Optim"},{"issue":"6","key":"9911_CR40","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"RT Marler","year":"2004","unstructured":"Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26(6):369\u2013395. https:\/\/doi.org\/10.1007\/s00158-003-0368-6","journal-title":"Struct Multidiscip Optim"},{"key":"9911_CR41","doi-asserted-by":"publisher","first-page":"30,421","DOI":"10.1109\/ACCESS.2020.2972619","volume":"8","author":"K Meng","year":"2020","unstructured":"Meng K, Tang Q, Zhang Z et al (2020) An improved lexicographical whale optimization algorithm for the type-ii assembly line balancing problem considering preventive maintenance scenarios. IEEE Access 8:30,421-30,435. https:\/\/doi.org\/10.1109\/ACCESS.2020.2972619","journal-title":"IEEE Access"},{"key":"9911_CR42","unstructured":"Miksch T, Gambier A (2011) Fault-tolerant control by using lexicographic multi-objective optimization. In: 2011 8th Asian Control Conference (ASCC), IEEE, pp 1078\u20131083"},{"issue":"2","key":"9911_CR43","doi-asserted-by":"publisher","first-page":"20","DOI":"10.48550\/arXiv.0912.1832","volume":"6","author":"AK Ojha","year":"2009","unstructured":"Ojha AK, Biswal KK (2009) Lexicographic multi-objective geometric programming problems. Int J Comput Sci Issues 6(2):20\u201324. https:\/\/doi.org\/10.48550\/arXiv.0912.1832","journal-title":"Int J Comput Sci Issues"},{"key":"9911_CR44","doi-asserted-by":"publisher","unstructured":"Schmiedle F, Drechsler N, Gro\u00dfe D, et\u00a0al (2001) Priorities in multi-objective optimization for genetic programming. In: Proceedings of the 3rd Annual Conference on Genetic and Evolutionary Computation. Morgan Kaufmann Publishers Inc., GECCO\u201901, pp 129\u2013136, https:\/\/doi.org\/10.5555\/2955239.2955256","DOI":"10.5555\/2955239.2955256"},{"issue":"4","key":"9911_CR45","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1109\/TEVC.2011.2161872","volume":"16","author":"O Sch\u00fctze","year":"2012","unstructured":"Sch\u00fctze O, Esquivel X, Lara A et al (2012) Using the averaged hausdorff distance as a performance measure in evolutionary multiobjective optimization. IEEE Trans Evol Comput 16(4):504\u2013522. https:\/\/doi.org\/10.1109\/TEVC.2011.2161872","journal-title":"IEEE Trans Evol Comput"},{"key":"9911_CR46","doi-asserted-by":"publisher","unstructured":"Seada H, Deb K (2015) U-NSGA-III: a unified evolutionary optimization procedure for single, multiple, and many objectives: proof-of-principle results. In: Gaspar-Cunha A, Henggeler\u00a0Antunes C, Coello CC (eds.), Evolutionary Multi-Criterion Optimization, vol 9019. Springer International Publishing, Cham, pp 34\u201349, https:\/\/doi.org\/10.1007\/978-3-319-15892-1_3","DOI":"10.1007\/978-3-319-15892-1_3"},{"issue":"2","key":"9911_CR47","doi-asserted-by":"publisher","first-page":"219","DOI":"10.4171\/EMSS\/4-2-3","volume":"4","author":"YD Sergeyev","year":"2017","unstructured":"Sergeyev YD (2017) Numerical infinities and infinitesimals: methodology, applications, and repercussions on two Hilbert problems. EMS Surv Math Sci 4(2):219\u2013320. https:\/\/doi.org\/10.4171\/EMSS\/4-2-3","journal-title":"EMS Surv Math Sci"},{"issue":"1","key":"9911_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TEVC.2020.3013290","volume":"25","author":"K Shang","year":"2020","unstructured":"Shang K, Ishibuchi H, He L et al (2020) A survey on the hypervolume indicator in evolutionary multiobjective optimization. IEEE Trans Evol Comput 25(1):1\u201320. https:\/\/doi.org\/10.1109\/TEVC.2020.3013290","journal-title":"IEEE Trans Evol Comput"},{"issue":"4","key":"9911_CR49","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1016\/0377-2217(82)90202-8","volume":"11","author":"HD Sherali","year":"1982","unstructured":"Sherali HD (1982) Equivalent weights for lexicographic multi-objective programs: characterizations and computations. Eur J Oper Res 11(4):367\u2013379. https:\/\/doi.org\/10.1016\/0377-2217(82)90202-8","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9911_CR50","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF00934527","volume":"39","author":"HD Sherali","year":"1983","unstructured":"Sherali HD, Soyster AL (1983) Preemptive and nonpreemptive multi-objective programming: relationship and counterexamples. J Optim Theory Appl 39(2):173\u2013186. https:\/\/doi.org\/10.1007\/BF00934527","journal-title":"J Optim Theory Appl"},{"issue":"2","key":"9911_CR51","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/A:1017570507125","volume":"109","author":"J Vada","year":"2001","unstructured":"Vada J, Slupphaug O, Johansen TA (2001) Optimal prioritized infeasibility handling in model predictive control: parametric preemptive multiobjective linear programming approach. J Optim Theory Appl 109(2):385\u2013413. https:\/\/doi.org\/10.1023\/A:1017570507125","journal-title":"J Optim Theory Appl"},{"issue":"11","key":"9911_CR52","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1016\/S0005-1098(01)00143-1","volume":"37","author":"J Vada","year":"2001","unstructured":"Vada J, Slupphaug O, Johansen TA et al (2001) Linear MPC with optimal prioritized infeasibility handling: application, computational issues and stability. Automatica 37(11):1835\u20131843. https:\/\/doi.org\/10.1016\/S0005-1098(01)00143-1","journal-title":"Automatica"},{"key":"9911_CR53","unstructured":"Weber E, Rizzoli AE, Soncini-Sessa R, et\u00a0al (2002) Lexicographic optimisation for water resources planning: the case of lake verbano, italy. In: 1st International Congress on Environmental Modelling and Software - Lugano, Switzerland, https:\/\/scholarsarchive.byu.edu\/iemssconference\/2002\/all\/44\/"},{"issue":"2","key":"9911_CR54","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s00186-011-0360-7","volume":"74","author":"M Zarepisheh","year":"2011","unstructured":"Zarepisheh M, Khorram E (2011) On the transformation of lexicographic nonlinear multiobjective programs to single objective programs. Math Methods Oper Res 74(2):217\u2013231. https:\/\/doi.org\/10.1007\/s00186-011-0360-7","journal-title":"Math Methods Oper Res"},{"issue":"6","key":"9911_CR55","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans on Evol Comp 11(6):712\u2013731. https:\/\/doi.org\/10.1109\/TEVC.2007.892759","journal-title":"IEEE Trans on Evol Comp"},{"issue":"2","key":"9911_CR56","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/j.ejor.2021.05.048","volume":"298","author":"S Zhong","year":"2021","unstructured":"Zhong S, Jiang Y, Nielsen OA (2021) Lexicographic multi-objective road pricing optimization considering land use and transportation effects. Eur J Oper Res 298(2):496\u2013509. https:\/\/doi.org\/10.1016\/j.ejor.2021.05.048","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9911_CR57","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1023\/B:AURC.0000019366.84601.8e","volume":"65","author":"AV Zykina","year":"2004","unstructured":"Zykina AV (2004) A lexicographic optimization algorithm. Autom Remote Control 65(3):363\u2013368. https:\/\/doi.org\/10.1023\/B:AURC.0000019366.84601.8e","journal-title":"Autom Remote Control"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09911-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-022-09911-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-022-09911-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T08:16:42Z","timestamp":1686125802000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-022-09911-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,16]]},"references-count":57,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["9911"],"URL":"https:\/\/doi.org\/10.1007\/s11047-022-09911-4","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,16]]},"assertion":[{"value":"25 July 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 August 2022","order":2,"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.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}