.png){kind=icon}
.png){kind=icon}
Return
DEA-based centralized resource allocation with network flows
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.12845.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This study investigates the centralized resource allocation problem among individual units using network flow theory in a data envelopment analysis (DEA) framework. Existing research on DEA-based resource allocation is primarily concerned with the amount of allocated resources to individual units, and only a few studies have considered resource flows when resources are allocated. To identify the internal structure of the resource allocation process, network structure is introduced and network flow theory is used to search for the optimal resource allocation scheme. Moreover, resource allocation cost is considered in network flows and a resource allocation gain (RAG) function is formulated to provide a quantitative analysis of the trade-off between production gains from resource allocation and resource allocation cost in the resource allocation process. In addition, several characteristics of the RAG function are also discussed. Lastly, the proposed method is demonstrated through an expository example with several random data and an application of the centralized resource reallocation to bank systems.
Keywords:
data envelopment analysis
resource allocation
network flows
resource allocation cost
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K