• About
  • Policies
  • What is open access
  • Library
  • Contact
Advanced search
      View Item 
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      •   BUIR Home
      • Scholarly Publications
      • Faculty of Engineering
      • Department of Industrial Engineering
      • View Item
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      Solution approaches for equitable multiobjective integer programming problems

      Thumbnail
      View / Download
      748.2 Kb
      Author(s)
      Bashir, Bashir
      Karsu, Özlem
      Date
      2022-04
      Source Title
      Annals of Operations Research
      Print ISSN
      0254-5330
      Publisher
      Springer
      Volume
      311
      Issue
      2
      Pages
      967 - 995
      Language
      English
      Type
      Article
      Item Usage Stats
      6
      views
      4
      downloads
      Abstract
      We 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.
      Keywords
      Convex cones
      Equitable dominance
      Equitable efficiency
      Equitable preferences
      Fairness
      Generalized Lorenz dominance
      Interactive algorithm
      Multi-objective knapsack problem
      Multiobjective integer programming
      Permalink
      http://hdl.handle.net/11693/111527
      Published Version (Please cite this version)
      https://doi.org/10.1007/s10479-020-03613-9
      Collections
      • Department of Industrial Engineering 758
      Show full item record

      Browse

      All of BUIRCommunities & CollectionsTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCoursesThis CollectionTitlesAuthorsAdvisorsBy Issue DateKeywordsTypeDepartmentsCourses

      My Account

      Login

      Statistics

      View Usage StatisticsView Google Analytics Statistics

      Bilkent University

      If you have trouble accessing this page and need to request an alternate format, contact the site administrator. Phone: (312) 290 2976
      © Bilkent University - Library IT

      Contact Us | Send Feedback | Off-Campus Access | Admin | Privacy