.png){kind=icon}
返回
Solution approaches for equitable multiobjective integer programming problems
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-020-03613-9.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Equitable preferences
Equitable efficiency
Equitable dominance
Generalized Lorenz dominance
Multi-objective knapsack problem
Convex cones
Fairness
Multiobjective integer programming
Interactive algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
A method for finding the set of non-dominated vectors for multiple objective integer linear programs一种求多目标整数线性规划非支配向量集的方法
PREAI
分享收藏
查看更多内容