{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,15]],"date-time":"2024-05-15T00:30:46Z","timestamp":1715733046398},"reference-count":24,"publisher":"Vilnius University Press","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"abstract":"<jats:p>The Multi-Objective Mixed-Integer Programming (MOMIP) problem is one of the most challenging. To derive its Pareto optimal solutions one can use the well-known Chebyshev scalarization and Mixed-Integer Programming (MIP) solvers. However, for a large-scale instance of the MOMIP problem, its scalarization may not be solved to optimality, even by state-of-the-art optimization packages, within the time limit imposed on optimization. If a MIP solver cannot derive the optimal solution within the assumed time limit, it provides the optimality gap, which gauges the quality of the approximate solution. However, for the MOMIP case, no information is provided on the lower and upper bounds of the components of the Pareto optimal outcome. For the MOMIP problem with two and three objective functions, an algorithm is proposed to provide the so-called interval representation of the Pareto optimal outcome designated by the weighting vector when there is a time limit on solving the Chebyshev scalarization. Such interval representations can be used to navigate on the Pareto front. The results of several numerical experiments on selected large-scale instances of the multi-objective multidimensional 0\u20131 knapsack problem illustrate the proposed approach. The limitations and possible enhancements of the proposed method are also discussed.<\/jats:p>","DOI":"10.15388\/24-infor549","type":"journal-article","created":{"date-parts":[[2024,4,12]],"date-time":"2024-04-12T06:59:13Z","timestamp":1712905153000},"page":"255-282","source":"Crossref","is-referenced-by-count":0,"title":["A General Framework for Providing Interval Representations of Pareto Optimal Outcomes for Large-Scale Bi- and Tri-Criteria MIP Problems"],"prefix":"10.15388","author":[{"given":"Grzegorz","family":"Filcek","sequence":"first","affiliation":[]},{"given":"Janusz","family":"Miroforidis","sequence":"additional","affiliation":[]}],"member":"6097","published-online":{"date-parts":[[2024,4,12]]},"reference":[{"key":"2024051408123120479_j_infor549_ref_001","doi-asserted-by":"publisher","first-page":"2137","DOI":"10.1016\/j.asoc.2012.03.020","article-title":"Mixed integer programming of multiobjective hydro-thermal self scheduling","volume":"12","year":"2012","journal-title":"Applied Soft Computing"},{"key":"2024051408123120479_j_infor549_ref_002","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-1-4471-5295-8_2","volume-title":"Applications of Multi-Criteria and Game Theory Approaches: Manufacturing and Logistics","year":"2014"},{"key":"2024051408123120479_j_infor549_ref_003","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01581647","article-title":"Calculating Surrogate Constraints","volume":"19","year":"1980","journal-title":"Mathematical Programming"},{"key":"2024051408123120479_j_infor549_ref_004","doi-asserted-by":"publisher","volume-title":"Multicriteria Optimization","year":"2005","DOI":"10.1007\/3-540-27659-9"},{"issue":"1","key":"2024051408123120479_j_infor549_ref_005","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.ejor.2013.10.005","article-title":"A bi-objective model for the location of landfills for municipal solid waste","volume":"235","year":"2014","journal-title":"European Journal of Operational Research"},{"key":"2024051408123120479_j_infor549_ref_006","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2022.106012","article-title":"Branch-and-bound and objective branching with three or more objectives","volume":"148","year":"2022","journal-title":"Computers & Operations Research"},{"issue":"6","key":"2024051408123120479_j_infor549_ref_007","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","article-title":"A multiphase-dual algorithm for the zero-one integer programming problem","volume":"13","year":"1965","journal-title":"Operations Research"},{"issue":"4","key":"2024051408123120479_j_infor549_ref_008","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1287\/opre.16.4.741","article-title":"Surrogate constraints","volume":"16","year":"1968","journal-title":"Operations Research"},{"key":"2024051408123120479_j_infor549_ref_009"},{"key":"2024051408123120479_j_infor549_ref_010"},{"key":"2024051408123120479_j_infor549_ref_011","doi-asserted-by":"publisher","volume-title":"Soft Computing for Complex Multiple Criteria Decision Making","year":"2006","DOI":"10.1007\/0-387-30177-1"},{"key":"2024051408123120479_j_infor549_ref_012","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1007\/s10957-013-0498-y","article-title":"Two-sided Pareto front approximations","volume":"162","year":"2014","journal-title":"Journal of Optimization Theory and Its Applications"},{"key":"2024051408123120479_j_infor549_ref_013","doi-asserted-by":"publisher","DOI":"10.1063\/1.5090005","article-title":"Lower and upper bounds for the general multiobjective optimization problem","volume":"2070","year":"2019","journal-title":"AIP Conference Proceedings"},{"key":"2024051408123120479_j_infor549_ref_014","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10898-020-00946-4","article-title":"Cooperative multiobjective optimization with bounds on objective functions","volume":"79","year":"2021","journal-title":"Journal of Global Optimization"},{"key":"2024051408123120479_j_infor549_ref_015","doi-asserted-by":"publisher","first-page":"5617","DOI":"10.1007\/s12351-022-00708-y","article-title":"Probing the Pareto front of a large-scale multiobjective problem with a MIP solver","volume":"22","year":"2022","journal-title":"Operational Research"},{"key":"2024051408123120479_j_infor549_ref_016","doi-asserted-by":"publisher","volume-title":"Multiple Criteria Decision Making by Multiobjective Optimization \u2013 A Toolbox","year":"2016","DOI":"10.1007\/978-3-319-32756-3"},{"key":"2024051408123120479_j_infor549_ref_017","doi-asserted-by":"publisher","volume-title":"Nonlinear Multiobjective Optimization","year":"1999","DOI":"10.1007\/978-1-4615-5563-6"},{"key":"2024051408123120479_j_infor549_ref_018","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s10898-021-01022-1","article-title":"Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems","volume":"80","year":"2021","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"2024051408123120479_j_infor549_ref_019","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","article-title":"Lagrangean\/surrogate relaxation for generalized assignment problems","volume":"114","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"2024051408123120479_j_infor549_ref_020","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2015.02.010","article-title":"Efficient automated schematic map drawing using multiobjective mixed integer programming","volume":"61","year":"2015","journal-title":"Computers & Operations Research"},{"issue":"3","key":"2024051408123120479_j_infor549_ref_021","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","article-title":"Multi-objective branch and bound","volume":"260","year":"2017","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2024051408123120479_j_infor549_ref_022","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1016\/j.ejor.2012.11.019","article-title":"A multi-objective mathematical model for the industrial hazardous waste location-routing problem","volume":"226","year":"2013","journal-title":"European Journal of Operational Research"},{"key":"2024051408123120479_j_infor549_ref_023","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/BFb0007163","volume-title":"Analysis and Algorithms of Optimization Problems","volume":"82","year":"1986"},{"key":"2024051408123120479_j_infor549_ref_024","volume-title":"Sampling Uniformly from the Unit Simplex","year":"2004"}],"container-title":["Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1331\/text","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/informatica.vu.lt\/journal\/INFORMATICA\/article\/1331\/text","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,14]],"date-time":"2024-05-14T05:15:21Z","timestamp":1715663721000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/24-INFOR549"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":24,"alternative-id":["10.15388\/24-INFOR549"],"URL":"https:\/\/doi.org\/10.15388\/24-infor549","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}