Generating strong defining hyperplanes of the production possibility set in data envelopment analysis

In data envelopment analysis (DEA), identification of the strong defining hyperplanes of the empirical production possibility set (PPS) is important, because they can be used for determining rates of change of outputs with change in inputs. Also, efficient hyperplanes determine the nature of returns to scale. The present work proposes a method for generating all linearly independent strong defining hyperplanes (LISDHs) of the PPS passing through a specific decision making unit (DMU). To this end, corresponding to each efficient unit, a perturbed inefficient unit will be defined and, using at most m+s linear programs, all LISDHs passing through the DMU will be determined, where m and s are the numbers of inputs and outputs, respectively.     

Finding weak defining hyperplanes of PPS of the BCC model

Production possibility set (PPS) is intersection of the several halfspaces. Every halfspace corresponds with one strong or weak defining hyperplane (facet). This research proposes a method to find weak defining hyperplanes of PPS of BCC model. We state and prove some properties relative to our method. Numerical examples are provided for illustration.     

Evaluating returns to scale and congestion by production possibility set in intersection form

This research proposes a new method to estimate returns to scale(RTS) of decision making units(DM Us) with multiple inputs and outputs.The state of return to scale includes increasing RTS,constant RTS,decreasing RTS and evidence of congestion.The method is based on the production possibility set in the intersection form given by a set of linear inequalities.We propose and prove the necessary and sufficient conditions for the RTS estimation.With the new procedure,to estimate the RTS of a DM U is simply to ch...     

二阶段加法DEA模型的生产可能集与生产前沿面

针对二阶段加法DEA模型的中间要素的特殊性,构造生产可能集及其公理体系,由此定义生产前沿面,并建立DEA有效和生产前沿面之间的等价关系.通过构造一个多目标规划模型,建立该问题的Pareto有效解与DEA有效之间的等价关系.     

Dynamic concept of returns to scales and its characteristics on production frontier in intersection form

This paper gives a dynamic concept and a new non-parametric method for evaluating returns to scale(RTS) of economic units with multiple inputs and outputs.It is frequently noticed that when we increase the input of a decision making unit(DMU) with a certain status of RTS,different status of RTS is observed.For example,when we increase the input of a DMU with constant RTS under the traditional method,a decreasing RTS is often observed instead of the expected constant RTS.We thus define the RTS of each DMU in both input expansion and contraction regions respectively.The research starts from transferring the production possibility set into the intersection form,by giving the explicit linear inequality representation of production frontiers.The RTS structural characteristics of DMUs’ on the production frontier are described.Status of RTS of those DMUs on the production frontier include increasing RTS,constant RTS,decreasing RTS,saturated RTS and evidence of congestion.Necessary and suficient conditions for RTS evaluation are provided.The definition and evaluation method given here provide more detailed economic characteristics of DMU for policy makers.     

Decomposition of algebraic sets and applications to weak centers of cubic systems

There are many methods such as Gröbner basis, characteristic set and resultant, in computing an algebraic set of a system of multivariate polynomials. The common difficulties come from the complexity of computation, singularity of the corresponding matrices and some unnecessary factors in successive computation. In this paper, we decompose algebraic sets, stratum by stratum, into a union of constructible sets with Sylvester resultants, so as to simplify the procedure of elimination. Applying this decomposition to systems of multivariate polynomials resulted from period constants of reversible cubic differential systems which possess a quadratic isochronous center, we determine the order of weak centers and discuss the bifurcation of critical periods.     

求DEA有效最速方向的一般方法

提出经验生产可能集的支撑超平面表示形式,在献[3]的基础上,对生产可能集内任意非DEA有效的决策单元,给出在生产可能集内,求解其DEA有效最速方向,使其最速达到DEA有效的一般方向,同时指出献[4]、[7]中的两处错误。     

On weak integrability and boundedness in Banach spaces

Thin and thick sets in normed spaces were defined and studied by M.I. Kadets and V.P. Fonf in 1983. In this paper, we give a new characterization of thick sets in terms of weak integrability of Banach space valued measurable functions. We also characterize thick sets in terms of boundedness of vector measures, and explain how this concept is related to the theory of barrelled spaces.     

Pairs,sets and sequences in first-order theories

In this paper we study the idea of theories with containers, like sets, pairs, sequences. We provide a modest framework to study such theories. We prove two concrete results. First, we show that first-order theories of finite signature that have functional non-surjective ordered pairing are definitionally equivalent to extensions in the same language of the basic theory of non-surjective ordered pairing. Second, we show that a first-order theory of finite signature is sequential (is a theory of sequences) iff it is definitionally equivalent to an extension in the same language of a system of weak set theory called WS.      

DEA models for ratio data: Convexity consideration

Data envelopment analysis (DEA) is defined based on observed units and by finding the distance of each unit to the border of estimated production possibility set (PPS). The convexity is one of the underlying assumptions of the PPS. This paper shows some difficulties of using standard DEA models in the presence of input-ratios and/or output-ratios. The paper defines a new convexity assumption when data includes a ratio variable. Then it proposes a series of modified DEA models which are capable to rectify this problem.     

On the structures and dimensions of Moran sets

The Moran sets and the Moran class are defined by geometric fashion that distinguishes the classical self_similar sets from the following points:(i) The placements of the basic sets at each step of the constructions can be arbitrary.(ii) The contraction ratios may be different at each step.(iii) The lower limit of the contraction ratios permits zero.The properties of the Moran sets and Moran class are studied, and the Hausdorff, packing and upper Box_counting dimensions of the Moran sets are determined by net measure techniques. It is shown that some important properties of the self_similar sets no longer hold for Moran sets.     

Finding strong defining hyperplanes of PPS using multiplier form

The production possibility set (PPS) is defined as the set of all inputs and outputs of a system in which inputs can produce outputs. In this paper, we deal with the problem of finding the strong defining hyperplanes of the PPS. These hyperplanes are equations that form efficient surfaces. It is well known that the optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, therefore, may have alternate optima for the multiplier form. Every optimal solution of the multiplier form yields a hyperplane which is supporting at the PPS. We will show that the hyperplane which corresponds to an extreme optimal solution of the multiplier form (in evaluating an efficient DMU), and whose components corresponding to inputs and outputs are non zero is a strong defining hyperplane of the PPS. This will be discussed in details in this paper. These hyperplanes are useful in sensitivity and stability analysis, the status of returns to scale of a DMU, incorporating performance into the efficient frontier analysis, and so on. Using numerical examples, we will demonstrate how to use the results.     

Special sets of the Hermitian surface and indicator sets

An interesting connection between special sets of the Hermitian surface of PG(3,q²), q odd, (after Shult 13 ) and indicator sets of line‐spreads of the three‐dimensional projective space is provided. Also, the CP‐type special sets are characterized. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 18–24, 2008     

广义超效率区间DEA模型及其有效性研究

根据样本单元的区间投入、区间产出定义最大样本生产可能集,建立基于最大样本生产可能集的广义超效率区间DEA模型,然后定义了待评价决策单元基于广义超效率区间DEA模型的超效率区间,并讨论了待评价决策单元的有效性,最后通过实例表明了广义超效率区间DEA模型的实用性.     

Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming

This paper extends the works by Olesen and Petersen (2003), Russell and Schworm (2006) and Cooper et al. (2007) about describing the efficient frontier of a production possibility set by the intersection of a finite number of closed halfspaces, in several ways. First, we decompose the efficient frontier into a smallest number of convex polyhedrons, or equivalently into a new class of efficient faces, called maximal efficient faces (MEFs). Second, we show how to identify all MEFs even if full dimensional efficient faces do not exist. Third, by applying the MEF decomposition to various real-world data sets, we demonstrate the validity of the MEF decomposition and how it can contribute to the DEA literature. Finally, we illustrate how to use the identified MEFs in practice.     

Index sets of classes of automatic structures

We obtain exact estimates in the arithmetical and analytical hierarchies of index sets of various classes of automatic models. We also obtain estimates for the existence problems for computable isomorphism and embedding of automatic structures.     

An extension of building sets and relative difference sets

Building sets are a successful tool for constructing semi‐regular divisible difference sets and, in particular, semi‐regular relative difference sets. In this paper, we present an extension theorem for building sets under simple conditions. Some of the semi‐regular relative difference sets obtained using the extension theorem are new in the sense that their ambient groups have smaller ranks than previously known. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 50–57, 2000     

Index sets of computable structures

The index set of a computable structure is the set of indices for computable copies of . We determine complexity of the index sets of various mathematically interesting structures including different finite structures, ℚ-vector spaces, Archimedean real-closed ordered fields, reduced Abelian p-groups of length less than ω², and models of the original Ehrenfeucht theory. The index sets for these structures all turn out to be m-complete Π _n ⁰ , d-Σ _n ⁰ , or Σ _n ⁰ , for various n. In each case the calculation involves finding an optimal sentence (i.e., one of simplest form) that describes the structure. The form of the sentence (computable Π_n, d-Σ_n, or Σ_n) yields a bound on the complexity of the index set. Whenever we show m-completeness of the index set, we know that the sentence is optimal. For some structures, the first sentence that comes to mind is not optimal, and another sentence of simpler form is shown to serve the purpose. For some of the groups, this involves Ramsey’s theory. Supported by the NSF grants DMS-0139626 and DMS-0353748. Supported by the NSF grant DMS-0502499 and by the Columbian Research Fellowship of the George Washington University. Supported by the NSF grant DMS-0353748. __________ Translated from Algebra i Logika, Vol. 45, No. 5, pp. 538–574, September–October, 2006.