2Charnes A, Cooper W W, Rhodes E. Measuring the efficiency of decision making units[J]. European Journal of Operation Research, 1978, 2: 429-444.
3Seiford L M, Thrall R M. Recent development in DEA: The mathematical programming approach to frontier analysis[J]. Journal of Econometrics, 1990, 46: 7-38.
4Wei Q L, Yan H, Hao G. Characteristics and structures of weak efficient surfaces of production possibility sets[J]. Journal of Mathematical Analysis and Applications, 2007, 327(2): 1055-1074.
5Wei Q L, Yan H. A method of transferring polyhedron between the intersection-form and the sum-form[J]. Computers and Mathematics with Applications, 2001, 41: 1327-1342.
6Graham R L. An efficient algorithm for determining the convex hull of a finite planar set[J]. Information Processing Letters, 1972, 1(4): 132-133.
7Jarvis R A. On the identification of the convex hull of a finite set of points in the plane[J]. Information Processing Letters, 1973, 2(1): 18-21.
8Eddy W F. A new convex hull algorithm for planar sets[J]. ACM Transactions on Mathematical Software (TOMS), 1997, 3(4): 398-403.
9Shamos M I. Geometric complexity[C]// Proceedings of Seventh Annual ACM Symposium on Theory of Computing, ACM, 1975: 224-233.
10Preparata F P. An optimal real-time algorithm for planar convex hulls[J]. Communications of the ACM, 1979, 22(7): 402-405.
