An interactive algorithm for resource allocation with balance concerns

We consider a resource allocation problem where a decision maker (DM) is to distribute a certain budget among alternative projects in order to create the best portfolio. The DM aims to generate a portfolio with (1) a high return and (2) a balanced distribution of resources among categories. We assum...

Full description

Saved in:
Bibliographic Details
Published in:OR Spectrum Vol. 43; no. 4; pp. 983 - 1005
Main Authors: Özpeynirci, Selin, Özpeynirci, Özgür, Mousseau, Vincent
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.12.2021
Springer Nature B.V
Springer Verlag
Subjects:
Algorithms
Business and Management
Calculus of Variations and Optimal Control; Optimization
Computer Science
Decision making
Operations Research/Decision Theory
Original Article
Portfolio performance
Resource allocation
Balance distribution
Portfolio decision analysis
Interactive algorithm
Resource allocation
ISSN:0171-6468, 1436-6304
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We consider a resource allocation problem where a decision maker (DM) is to distribute a certain budget among alternative projects in order to create the best portfolio. The DM aims to generate a portfolio with (1) a high return and (2) a balanced distribution of resources among categories. We assume that the DM has a quasiconcave value function and provides no explicit value for the target distribution of resources over categories. We develop an interactive approach that requires the DM to make pairwise comparisons among alternative portfolios. We present the developed approach on an illustrative example and conduct an extensive computational experiment. In majority of the instances, the incumbent solution proposed by the algorithm is either equal or very close to the best solution.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0171-6468
1436-6304
DOI:10.1007/s00291-021-00632-1