A semi-infinite programming model in data envelopment analysis

作     者：Jess, A Jongen, HT Neralic, L Stein, O 

作者机构：Virginia Tech Interdisciplinary Ctr Appl Math Blacksburg VA 24061 USA Aachen Univ Technol Inst Tech Chem & Makromol Chem Aachen Germany Aachen Univ Technol Dept Math C Aachen Germany Univ Zagreb Fac Econ Zagreb 41000 Croatia 

出 版 物：《OPTIMIZATION》 (最优化)

年 卷 期：2001年第49卷第4期

页      面：369-385页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070105[理学-运筹学与控制论] 0701[理学-数学] 

基　　金：Air Force Office of Scientific Research(F49620-98-1-0329) Alexander von Humboldt-Stiftung 

主　　题：data envelopment analysis multi-objective programming semi-infinite programming bi-level optimization chemical engineering Pareto efficiency 

摘      要：We consider a model for data envelopment analysis with infinitely many decisionmaking units. The determination of the relative efficiency of a given decision-making unit amounts to the solution of a semi-infinite optimization problem. We show that a decision-making unit of maximal relative efficiency exists and that it is 100% efficient. Moreover, this decision-making unit can be found by calculating a zero of the semiinfinite constraint function. For the latter task we propose a hi-level algorithm. We apply this algorithm to a problem from chemical engineering and present numerical results.