An Optimization Approach to the Construction of a Sequence of Benchmark Targets in DEA-Based Benchmarkingopen accessAn Optimization Approach to the Construction of a Sequence of Benchmark Targets in DEA-Based Benchmarking
- Other Titles
- An Optimization Approach to the Construction of a Sequence of Benchmark Targets in DEA-Based Benchmarking
- Authors
- 박재훈; 임성묵; 배혜림
- Issue Date
- Dec-2014
- Publisher
- 대한산업공학회
- Keywords
- Data Envelopment Analysis(DEA); Multicriteria; Benchmarking Path; Optimization
- Citation
- 대한산업공학회지, v.40, no.6, pp 628 - 641
- Pages
- 14
- Indexed
- KCI
- Journal Title
- 대한산업공학회지
- Volume
- 40
- Number
- 6
- Start Page
- 628
- End Page
- 641
- URI
- https://scholarworks.dongguk.edu/handle/sw.dongguk/15939
- DOI
- 10.7232/JKIIE.2014.40.6.628
- ISSN
- 1225-0988
2234-6457
- Abstract
- Stepwise efficiency improvement in data envelopment analysis (DEA)-based benchmarking is a realistic and effective method by which inefficient decision making units (DMUs) can choose benchmarks in a stepwise manner and, thereby, effect gradual performance improvement. Most of the previous research relevant to stepwise efficiency improvement has focused primarily on how to stratify DMUs into multiple layers and how to select immediate benchmark targets in leading levels for lagging-level DMUs. It can be said that the sequence of benchmark targets was constructed in a myopic way, which can limit its effectiveness. To address this issue, this paper proposes an optimization approach to the construction of a sequence of benchmarks in DEA-based benchmarking, wherein two optimization criteria are employed : similarity of input-output use patterns, and proximityof input-output use levels between DMUs. To illustrate the proposed method, we applied it to the benchmarking of 23 national universities in South Korea.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - Dongguk Business School > Department of Business Administration > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.