Combinatorial efficiency evaluation: the knapsack problem in data envelopment analysis
1College of Information System and Management, National University of Defense Technology, Changsha 410073, China.
Abstract:
The traditional data envelopment analysis (DEA) literatures generally concentrated on the efficiency evaluation of single decision making unit (DMU). However, in many practical problems, the decision makers are required to choose a number of DMUs instead of a single one from the DMUs set. Therefore, it is necessary to study the combinatorial efficiency evaluation problem which can be illustrated as a knapsack problem naturally. It is indicated that the basic model proposed by Cook and Green may have some drawbacks and a modified model, which is combined with the super efficiency model, is proposed in this paper. What is more, our proposed model is more persuasive to the decision makers because it is able to provide a unique best combination of DMUs. An adapted local search algorithm is developed as a solver of this problem. Finally, numerical examples are provided to examine the validity of our proposed model and the adapted local search algorithm.
More Related Videos
20:24Characterization of Complex Systems Using the Design of Experiments Approach: Transient Protein Expression in Tobacco as a Case Study
Published on: January 31, 2014
09:12Optimization of Processing of Tiebangchui with Highland Barley Wine Based on the Box-Behnken Design Combined with the Entropy Method
Published on: May 19, 2023
Related Concept Videos
Production Efficiency
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Methods of Medium Optimization
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Optimization Problems
