使决策单元变为DEA有效的偏差和最小法

某决策单元为非 DEA有效 ( C2 R或 C2 GS2 ) ,为了将它变为 DEA有效 ,在找出其对应点附近的一些有效前沿面的基础上 ,给出了使其对应点与这些有效前沿面上的点的输入、输出的偏差和最小的方法 .     

Finding DEA-efficient hyperplanes using MOLP efficient faces

This paper suggests a method for finding efficient hyperplanes with variable returns to scale the technology in data envelopment analysis (DEA) by using the multiple objective linear programming (MOLP) structure. By presenting an MOLP problem for finding the gradient of efficient hyperplanes, We characterize the efficient faces. Thus, without finding the extreme efficient points of the MOLP problem and only by identifying the efficient faces of the MOLP problem, we characterize the efficient hyperplanes which make up the DEA efficient frontier. Finally, we provide an algorithm for finding the efficient supporting hyperplanes and efficient defining hyperplanes, which uses only one linear programming problem.     

The interval efficiency based on the optimistic and pessimistic points of view

Data envelopment analysis (DEA) is a data-oriented approach for evaluating the performances of a set of peer entities called decision-making units (DMUs), whose performance is determined based on multiple measures. The traditional DEA, which is based on the concept of efficiency frontier (output frontier), determines the best efficiency score that can be assigned to each DMU. Based on these scores, DMUs are classified into DEA-efficient (optimistic efficient) or DEA-non-efficient (optimistic non-efficient) units, and the DEA-efficient DMUs determine the efficiency frontier. There is a comparable approach which uses the concept of inefficiency frontier (input frontier) for determining the worst relative efficiency score that can be assigned to each DMU. DMUs on the inefficiency frontier are specified as DEA-inefficient or pessimistic inefficient, and those that do not lie on the inefficient frontier, are declared to be DEA-non-inefficient or pessimistic non-inefficient. In this paper, we argue that both relative efficiencies should be considered simultaneously, and any approach that considers only one of them will be biased. For measuring the overall performance of the DMUs, we propose to integrate both efficiencies in the form of an interval, and we call the proposed DEA models for efficiency measurement the bounded DEA models. In this way, the efficiency interval provides the decision maker with all the possible values of efficiency, which reflect various perspectives. A numerical example is presented to illustrate the application of the proposed DEA models.     

A new approach for achievement of the equilibrium efficient frontier with fixed-sum outputs

In a recent paper, Yang et al developed an algorithm based on the extended minimal adjustment strategy and the equilibrium competition strategy to achieve a common equilibrium efficient frontier. However, the computational burden of their algorithm is challenging when a sample contains many inefficient decision-making units (DMUs). In this paper, we propose a linear programming model that can achieve a common equilibrium efficient frontier in a single step, regardless of the number of inefficient DMUs. Furthermore, we demonstrate the existence and the non-uniqueness of the equilibrium efficient frontier and identify its shortcomings through an example. Next, we extend our approach to incorporate weight restrictions to indicate the relative importance of the different inputs and outputs and introduce the secondary goal of minimizing the maximal relative deviation for each fixed-sum output, which can result in a unique equilibrium efficient frontier.     

Decompositions and boundary coverings of non-convex fat polyhedra

We show that any locally-fat (or (α,β)-covered) polyhedron with convex fat faces can be decomposed into O(n) tetrahedra, where n is the number of vertices of the polyhedron. We also show that the restriction that the faces are fat is necessary: there are locally-fat polyhedra with non-fat faces that require Ω(n²) pieces in any convex decomposition. Furthermore, we show that if we want the tetrahedra in the decomposition to be fat themselves, then their number cannot be bounded as a function of n in the worst case. Finally, we obtain several results on the problem where we want to only cover the boundary of the polyhedron, and not its entire interior.     

一类投资组合选择的线性规划方法研究

如何在摩擦市场下构建最优组合一直是一个非常有意义的问题.人们通常在有效前沿上选择最优的投资组合,但是值得注意的是,如果我们考虑摩擦因素,原本的有效组合将不再有效.探讨如何在无风险借贷利率不同的摩擦市场下构建投资组合模型.为了得到最优策略,我们先利用Karush-Kuhn-Tucker条件给出一类线性规划问题求解方法,然后具体阐述如何将投资决策问题转化为可以求解的线性规划问题,最后给出在无风险借贷利率不同的情况下投资组合的有效边界.     

Super-efficiency DEA in the presence of infeasibility

It is well known that super-efficiency data envelopment analysis (DEA) approach can be infeasible under the condition of variable returns to scale (VRS). By extending of the work of Chen (2005), the current study develops a two-stage process for calculating super-efficiency scores regardless whether the standard VRS super-efficiency mode is feasible or not. The proposed approach examines whether the standard VRS super-efficiency DEA model is infeasible. When the model is feasible, our approach yields super-efficiency scores that are identical to those arising from the original model. For efficient DMUs that are infeasible under the super-efficiency model, our approach yields super-efficiency scores that characterize input savings and/or output surpluses. The current study also shows that infeasibility may imply that an efficient DMU does not exhibit super-efficiency in inputs or outputs. When infeasibility occurs, it can be necessary that (i) both inputs and outputs be decreased to reach the frontier formed by the remaining DMUs under the input-orientation and (ii) both inputs and outputs be increased to reach the frontier formed by the remaining DMUs under the output-orientation. The newly developed approach is illustrated with numerical examples.     

Input–output substitutability and strongly monotonic p-norm least distance DEA measures

In DEA, there are two frameworks for efficiency assessment and targeting: the greatest and the least distance framework. The greatest distance framework provides us with the efficient targets that are determined by the farthest projections to the assessed decision making unit via maximization of the p-norm relative to either the strongly efficient frontier or the weakly efficient frontier. Non-radial measures belonging to the class of greatest distance measures are the slacks-based measure (SBM) and the range-adjusted measure (RAM). Whereas these greatest distance measures have traditionally been utilized because of their computational ease, least distance projections are quite often more appropriate than greatest distance projections from the perspective of managers of decision-making units because closer efficient targets may be attained with less effort. In spite of this desirable feature of the least distance framework, the least distance (in) efficiency versions of the additive measure, SBM and RAM do not even satisfy weak monotonicity. In this study, therefore, we introduce and investigate least distance p-norm inefficiency measures that satisfy strong monotonicity over the strongly efficient frontier. In order to develop these measures, we extend a free disposable set and introduce a tradeoff set that implements input–output substitutability.     

An equilibrium efficiency frontier data envelopment analysis approach for evaluating decision-making units with fixed-sum outputs

Based on the minimal reduction strategy, Yang et al. (2011) developed a fixed-sum output data envelopment analysis (FSODEA) approach to evaluate the performance of decision-making units (DMUs) with fixed-sum outputs. However, in terms of such a strategy, all DMUs compete over fixed-sum outputs with “no memory” that will result in differing efficient frontiers’ evaluations. To address the problem, in this study, we propose an equilibrium efficiency frontier data envelopment analysis (EEFDEA) approach, by which all DMUs with fixed-sum outputs can be evaluated based on a common platform (or equilibrium efficient frontier). The proposed approach can be divided into two stages. Stage 1 constructs a common evaluation platform via two strategies: an extended minimal adjustment strategy and an equilibrium competition strategy. The former ensures that original efficient DMUs are still efficient, guaranteeing the existence of a common evaluation platform. The latter makes all DMUs achieve a common equilibrium efficient frontier. Then, based on the common equilibrium efficient frontier, Stage 2 evaluates all DMUs with their original inputs and outputs. Finally, we illustrate the proposed approach by using two numerical examples.     

Computation of mean-semivariance efficient sets by the Critical Line Algorithm

The general mean-semivariance portfolio optimization problem seeks to determine the efficient frontier by solving a parametric non-quadratic programming problem. In this paper it is shown how to transform this problem into a general mean-variance optimization problem, hence the Critical Line Algorithm is applicable. This paper also discusses how to implement the critical line algorithm to save storage and reduce execution time.     

Determining a sequence of targets in DEA

Data Envelopment Analysis (DEA) can be used for assessing the relative efficiency of a number of operating units, finding, for each inefficient unit, a target operating point lying on the efficient frontier. Most DEA models project an inefficient unit onto a most distant target, which makes its attainment more difficult. In this paper, we advocate determining a sequence of targets, each one within an appropriate, short distance of the preceding. The proposed Constant Returns to Scale approach has two interesting features: (a) the sequence of targets ends in the efficient frontier and (b) the final, efficient target is generally closer to the original unit than the one-step projection is.     

Mean–variance asset–liability management: Cointegrated assets and insurance liability

The cointegration of major financial markets around the globe is well evidenced with strong empirical support. This paper considers the continuous-time mean–variance (MV) asset–liability management (ALM) problem for an insurer investing in an incomplete financial market with cointegrated assets. The number of trading assets is allowed to be less than the number of Brownian motions spanning the market. The insurer also faces the risk of paying uncertain insurance claims during the investment period. We assume that the cointegration market follows the diffusion limit of the error-correction model for cointegrated time series. Using the Markowitz (1952) MV portfolio criterion, we consider the insurer’s problem of minimizing variance in the terminal wealth, given an expected terminal wealth subject to interim random liability payments following a compound Poisson process. We generalize the technique developed by Lim (2005) to tackle this problem. The particular structure of cointegration enables us to solve the ALM problem completely in the sense that the solutions of the continuous-time portfolio policy and efficient frontier are obtained as explicit and closed-form formulas.     

证券数目变化时受到扰动的M-V有效前沿分析

基于M-V证券组合模型,在证券市场上不存在无风险资产且允许卖空条件下,探讨了证券数增加k种后原n种证券协方差矩阵发生改变情形下M-V证券组合有效前沿的漂移问题。通过引入扰动因子和扰动矩阵,给出了M-V证券组合有效前沿的漂移方向及其开口大小的变化情况．研究结果表明证券数增加了k种后有效前沿向左漂移以及它的开口变大,原证券组合的有效前沿完全落在新的证券组合可行集内．     

Choosing weights from alternative optimal solutions of dual multiplier models in DEA

In this paper we propose a two-step procedure to be used for the selection of the weights that we obtain from the multiplier model in a DEA efficiency analysis. It is well known that optimal solutions of the envelopment formulation for extreme efficient units are often highly degenerate and, consequently, have alternate optima for the weights. Different optimal weights may then be obtained depending, for instance, on the software used. The idea behind the procedure we present is to explore the set of alternate optima in order to help make a choice of optimal weights. The selection of weights for a given extreme efficient point is connected with the dimension of the efficient facets of the frontier. Our approach makes it possible to select the weights associated with the facets of higher dimension that this unit generates and, in particular, it selects those weights associated with a full dimensional efficient facet (FDEF) if any. In this sense the weights provided by our procedure will have the maximum support from the production possibility set. We also look for weights that maximize the relative value of the inputs and outputs included in the efficiency analysis in a sense to be described in this article.     

L1 regularization method in electrical impedance tomography by using the L1-curve (Pareto frontier curve)

Electrical impedance tomography (EIT), as an inverse problem, aims to calculate the internal conductivity distribution at the interior of an object from current-voltage measurements on its boundary. Many inverse problems are ill-posed, since the measurement data are limited and imperfect. To overcome ill-posedness in EIT, two main types of regularization techniques are widely used. One is categorized as the projection methods, such as truncated singular value decomposition (SVD or TSVD). The other categorized as penalty methods, such as Tikhonov regularization, and total variation methods. For both of these methods, a good regularization parameter should yield a fair balance between the perturbation error and regularized solution. In this paper a new method combining the least absolute shrinkage and selection operator (LASSO) and the basis pursuit denoising (BPDN) is introduced for EIT. For choosing the optimum regularization we use the L1-curve (Pareto frontier curve) which is similar to the L-curve used in optimising L2-norm problems. In the L1-curve we use the L1-norm of the solution instead of the L2 norm. The results are compared with the TSVD regularization method where the best regularization parameters are selected by observing the Picard condition and minimizing generalized cross validation (GCV) function. We show that this method yields a good regularization parameter corresponding to a regularized solution. Also, in situations where little is known about the noise level σ, it is also useful to visualize the L1-curve in order to understand the trade-offs between the norms of the residual and the solution. This method gives us a means to control the sparsity and filtering of the ill-posed EIT problem. Tracing this curve for the optimum solution can decrease the number of iterations by three times in comparison with using LASSO or BPDN separately.     

Variations on the theme of slacks-based measure of efficiency in DEA

In DEA, there are typically two schemes for measuring efficiency of DMUs; radial and non-radial. Radial models assume proportional change of inputs/outputs and usually remaining slacks are not directly accounted for inefficiency. On the other hand, non-radial models deal with slacks of each input/output individually and independently, and integrate them into an efficiency measure, called slacks-based measure (SBM). In this paper, we point out shortcomings of the SBM and propose four variants of the SBM model. The original SBM model evaluates efficiency of DMUs referring to the furthest frontier point within a range. This results in the hardest score for the objective DMU and the projection may go to a remote point on the efficient frontier which may be inappropriate as the reference. In an effort to overcome this shortcoming, we first investigate frontier (facet) structure of the production possibility set. Then we propose Variation I that evaluates each DMU by the nearest point on the same frontier as the SBM found. However, there exist other potential facets for evaluating DMUs. Therefore we propose Variation II that evaluates each DMU from all facets. We then employ clustering methods to classify DMUs into several groups, and apply Variation II within each cluster. This Variation III gives more reasonable efficiency scores with less effort. Lastly we propose a random search method (Variation IV) for reducing the burden of enumeration of facets. The results are approximate but practical in usage.     

Output–input ratio analysis and DEA frontier

Data envelopment analysis (DEA) is a mathematical programming technique for identifying efficient frontiers for peer decision making units (DMUs). The ability of identifying frontier DMUs prior to the DEA calculation is of extreme importance to an effective and efficient DEA computation. In this paper, we present mathematical properties which characterize the inherent relationships between DEA frontier DMUs and output–input ratios. It is shown that top-ranked performance by ratio analysis is a DEA frontier point. This in turn allows identification of membership of frontier DMUs without solving a DEA program. Such finding is useful in streamlining the solution of DEA.     

Bootstrap estimation of the efficient frontier

In this paper, we propose a bootstrap resampling methodology to obtain the confidence intervals for efficient portfolios weights and the sample characteristics of the mean-variance efficient frontier. We provide an estimate of efficient portfolios, compute the confidence region of the efficient frontier and get the prediction densities of the future efficient portfolio returns without distributional assumptions on returns. An extensive simulation study evaluates the finite-sample performance of these bootstrap intervals and stresses the advantages of such approach. Interestingly, the methodology can be easily modified to make inferences that incorporate our modelling of returns in the predictive efficient frontier estimation with or without additional managerial restrictions.     

Finding the efficiency score and RTS characteristic of DMUs by means of identifying the efficient frontier in DEA

Data envelopment analysis (DEA) is basically a linear programming based technique used for measuring the relative performance of organizational units, referred to as decision-making units (DMUs), where the presence of multiple inputs and outputs makes comparisons difficult. The ability of identifying frontier DMUs prior to the DEA calculation is of extreme importance to an effective and efficient DEA computation. In this paper, a method for identifying the efficient frontier is introduced. Then, the efficiency score and returns to scale (RTS) characteristic of DMUs will be produced by means of the equation of efficient frontier.     

Optimal Mean-Variance Investment-Reinsurance Strategy for a Dependent Risk Model with Ornstein-Uhlenbeck Process

In this paper, we investigate the optimal investment-reinsurance strategy for an insurer with two dependent classes of insurance business, where the claim number processes are correlated through a common shock. It is assumed that the insurer can invest her wealth into one risk-free asset and multiple risky assets, and meanwhile, the instantaneous rates of investment return are stochastic and follow mean-reverting processes. Based on the theory of linear-quadratic control, we adopt a backward stochastic differential equation (BSDE) approach to solve the mean-variance optimization problem. Explicit expressions for both the efficient strategy and efficient frontier are derived. Finally, numerical examples are presented to illustrate our results.