Solution approaches for equitable multiobjective integer programming problems

Simple item page
buir.contributor.authorBashir, Bashir
buir.contributor.authorKarsu, Özlem
dc.citation.epage995en_US
dc.citation.issueNumber2en_US
dc.citation.spage967en_US
dc.citation.volumeNumber311en_US
dc.contributor.authorBashir, Bashir
dc.contributor.authorKarsu, Özlem
dc.date.accessioned2023-02-17T12:54:51Z
dc.date.available2023-02-17T12:54:51Z
dc.date.issued2022-04
dc.departmentDepartment of Industrial Engineeringen_US
dc.description.abstractWe consider multi-objective optimization problems where the decision maker (DM) has equity concerns. We assume that the preference model of the DM satisfies properties related to inequity-aversion, hence we focus on finding nondominated solutions in line with the properties of inequity-averse preferences, namely the equitably nondominated solutions. We discuss two algorithms for finding good subsets of equitably nondominated solutions. The first approach is an extension of an interactive approach developed for finding the most preferred nondominated solution when the utility function is assumed to be quasiconcave. We find the most preferred equitably nondominated solution when the utility function is assumed to be symmetric quasiconcave. In the second approach we generate an evenly distributed subset of the set of equitably nondominated solutions to be considered further by the DM. We show the computational feasibility of the two algorithms on equitable multi-objective knapsack problem, in which projects in different categories are to be funded subject to a limited budget. We perform experiments to show and discuss the performances of the algorithms. © 2020, Springer Science+Business Media, LLC, part of Springer Nature.en_US
dc.identifier.doi10.1007/s10479-020-03613-9en_US
dc.identifier.issn0254-5330
dc.identifier.urihttp://hdl.handle.net/11693/111527
dc.language.isoEnglishen_US
dc.publisherSpringeren_US
dc.relation.isversionofhttps://doi.org/10.1007/s10479-020-03613-9en_US
dc.source.titleAnnals of Operations Researchen_US
dc.subjectConvex conesen_US
dc.subjectEquitable dominanceen_US
dc.subjectEquitable efficiencyen_US
dc.subjectEquitable preferencesen_US
dc.subjectFairnessen_US
dc.subjectGeneralized Lorenz dominanceen_US
dc.subjectInteractive algorithmen_US
dc.subjectMulti-objective knapsack problemen_US
dc.subjectMultiobjective integer programmingen_US
dc.titleSolution approaches for equitable multiobjective integer programming problemsen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Solution_approaches_for_equitable_multiobjective_integer_programming_problems.pdf
Size:
748.2 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.69 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Department of Industrial Engineering