%0 Journal Article
%T A polynomial-time algorithm to determine BCC efficient frontier without solving a mathematical programming problem
%J Annals of Optimization Theory and Practice
%I Firouzabad Institute of Higher Education
%Z 2588-3666
%A Sanei, Masoud
%A Hassasi, Hamid
%D 2018
%\ 02/01/2018
%V 1
%N 1
%P 59-68
%! A polynomial-time algorithm to determine BCC efficient frontier without solving a mathematical programming problem
%K Data Envelopment Analysis
%K BCC model
%K Efficient frontier
%K Point-wise minimum
%K Pareto efficient DMUs
%R 10.22121/aotp.2018.106001.1002
%X In this paper, we restrict our attention to the efficient frontier of the BCC model, where the BCC model is a well-known basic model in Data Envelopment Analysis (DEA). We here assume that each Decision Making Unit (DMU) has one input and one output. In order to obtain BCC efficient frontier, the paper proposes a polynomial-time algorithm of complexity bonded by to produce well-behaved affine functions. The produced functions are then used to determine a point-wise minimum of a finite number of affine functions. It will be shown that by finding this function, we in fact also determine the efficient frontier of the BCC model. The main advantage of this approach is ability to achieve the efficient frontier, without solving a mathematical programming problem. Also, all of the Pareto efficient DMUs, as BCC-efficient DMUs, can be easily obtained using the proposed algorithm. A numerical example is presented to explain the use and effectiveness of the proposed algorithm.
%U http://aotp.fabad-ihe.ac.ir/article_57302_5c8dd6ec55093c2a57f7701b57732648.pdf