有关判断决策单元的DEA有效性的新方法的探讨

为了判断决策单元是否(弱)DEA有效并克服现有的模型及[1]中模型在解决上述问题时的不足之处,本文将讨论的新模型是由CCR模型与CCGSS模型变来的,且定理的证明不同于[1]．还讨论了文中新模型的最优解的存在性,此外,研究了所有决策单元的输入输出的变化对某决策单元有效性的影响．     

含有偏好的DEA-BWM评价方法研究

针对传统的DEA模型在评估过程中并未考虑决策者对相关指标权重的偏好,将最优最差方法(BWM)嵌入到传统DEA模型中,基于决策者偏好排序的判断矩阵,构建一种含有偏好的DEA-BWM评价方法。首先在保持传统DEA方法的优势基础上,构建了CCR-BWM评价模型对各DMU进行评价。同时考虑为了便于各决策单元在统一权重基础上相互比较,构建了CSW-BWM公共权重模型。另外考虑决策单元自评和互评,构建了NCE-BWM中立型交叉效率。然后采用min-max方法分别将上述三种多目标评价模型转换为单目标线性规划进行求解。最后,选择一组算例对三种模型的有效性与合理性进行验证。     

DEA中连续C~2R模型理论的研究

在DEA中的C2R模型的基础上,针对决策单元输入与输出为[0,1]区间上的连续函数,建立了在一个时间区间内评价决策单元间的相对有效性的连续C2R模型以及其对偶模型,同时给出了决策单元的效率定义和弱DEA有效、DEA有效的定义.同时得到了弱对偶定理,从而初步构建了连续C2R模型的理论体系.     

考虑投入和产出指标偏好的广义DEA模型

广义DEA是一种基于决策单元和非决策单元自由选择参考集的扩展DEA模型.传统DEA模型的最优解大多是由线性规划随机计算的,未能充分考虑投入和产出指标的重要程度.将投入和产出指标的决策者偏好引入到广义DEA模型约束条件中,首先定义投入和产出指标偏好矩阵,再将该矩阵纳入广义DEA模型的约束条件,构建了带投入和产出指标偏好的广义DEA模型(GDEA-IP).接下来给出决策单元GDEA-IP有效性与评价指标的量纲选择无关性的证明,以及决策单元为GDEA-IP弱有效和有效的理论证明.算例分析说明GDEA-IP模型的有效性,通过和其它经典模型的对比分析,进一步说明该模型比广义DEA模型具有更大的灵活性和通用性,拓展了DEA方法的理论研究.     

Interval DEA模型中决策单元的投影问题

在传统的DEA模型中,最优相对效率模型是在不大于1的范围内研究决策单元的效率的,最差相对效率模型是在不小于1的范围内研究决策单元的效率,这两种模型在研究投影问题时,是在不同的范围内进行的,有一定的片面性.将在interval DEA模型中,研究决策单元的投影问题,该模型是在相同的约束域内研究最优和最差相对效率模型,得出的结论将更加全面,通过两个定理给出了非DEA有效的决策单元在DEA有效面上的投影表达式和非DEA无效的决策单元在DEA无效面上的投影表达式.同时,通过一个实例对决策单元在interval DEA模型中的投影结果与在传统的DEA模型的投影结果进行了比较,发现投影结果比传统模型得到的投影结果对实际的生产有更强的指导意义.     

随机逆DEA模型的输出估计研究

逆DEA模型讨论了在保持决策单元的效率指数(即最优值)不变的情况下,当输入水平给定时估计输出值.在逆DEA模型的基础上研究了效率指数提高的输出估计,讨论了带有随机因素的情况,将该问题转化成机会约束的线性规划问题,并用数值算例加以说明.     

具有偏好锥的面向输出的超效率DEA模型分析

鉴于传统DEA模型无法区分有效决策单元,超效率DEA模型未考虑决策者的偏好,现提出面向输出的权重受限的综合超效率DEA模型及其投影概念,并讨论该模型与其他超效率DEA模型之间的关系.接着,分析模型的最优目标函数值与决策单元有效性之间的关系,并讨论面向输出的权重受限的综合超效投影与多目标规划问题的非支配解之间的关系.最后,通过对中国西部12个地区工业企业科技创新效率综合评价,并与原有方法进行比较研究,得出本文方法更具优势和合理性.     

具有偏好锥的面向输出的超效率DEA模型分析

鉴于传统DEA模型无法区分有效决策单元,超效率DEA模型未考虑决策者的偏好,现提出面向输出的权重受限的综合超效率DEA模型及其投影概念,并讨论该模型与其他超效率DEA模型之间的关系.接着,分析模型的最优目标函数值与决策单元有效性之间的关系,并讨论面向输出的权重受限的综合超效投影与多目标规划问题的非支配解之间的关系.最后,通过对中国西部12个地区工业企业科技创新效率综合评价,并与原有方法进行比较研究,得出本文方法更具优势和合理性.     

实时求解线性规划问题的原对偶神经网络(英文)

本文探讨了线性规划的原问题与对偶问题理论,并在此基础上可开发出一种用于在线求解线性规划的递归神经网络和应用于冗余机器手臂逆运动学的求解问题上.如,Tang等人开展的原对偶神经网络.但鉴于对偶理论的复杂性和多样性,该原对偶神经网络模型仅可以得到线性规划问题的可行解,而本文对该网络模型改进后可得到线性规划问题的最优解.仿真结果证实了这种改进模型在解决线性规划问题上的有效性、正确性和高效率.     

基于三角形模糊数的DEA模型

基于三角形模糊数,扩展了数据包络分析(Data Envelopment Analysis,DEA)的CCR模型,建立了模糊DEA模型,用于解决决策单元的输入、输出中存在模糊数的问题.     

Robustness of the efficient DMUs in data envelopment analysis

By means of modified versions of CCR model based on evaluation of a decision making unit (DMU) relative to a reference set grouped by all other DMUs, sensitivity analysis of the CCR model in data envelopment analysis (DEA) is studied in this paper. The methods for sensitivity analysis are linear programming problems whose optimal values yield particular regions of stability. Sufficient and necessary conditions for upward variations of inputs and for downward variations of outputs of an (extremely) efficient DMU which remains efficient are provided. The approach does not require calculation of the basic solutions and of the inverse of the corresponding optimal basis matrix. The approach is illustrated by two numerical examples.     

Validating absolute weight bounds in Data Envelopment Analysis (DEA) models

The Charnes, Cooper and Rhodes (CCR) DEA model and its linear forms maximise the efficiency of the assessed decision making unit (DMU) and, at the same time, the ratio of this efficiency to the maximum efficiency taken across all the DMUs, the latter naturally always being equal to one. It has been shown recently that, in the presence of absolute weight bounds, these models may not maximise the ratio of these efficiencies, a fact that may cause problems with the interpretation and use of the optimal primal and dual solutions. For example, an inefficient DMU may have greater efficiency than its target unit for some weights. This paper investigates the problem in greater detail; it shows that, in the linear DEA model maximising the total virtual output of the assessed DMU, the problem occurs only if upper bounds are imposed on the output weights. A similar result is established for the model that minimises the total virtual input.     

动态投入产出最优控制模型

本文建立了一个新的具有上下限约束的投入产出问题的最优控制模型 ,并把最优控制问题转化为动态规划问题 ,利用动态最优化的方法给出了该问题的求解方法     

一类带有MaxEMin评判的补偿型随机规划算法

补偿型随机规划一般假定随机变量的概率分布具有完备信息, 但实际情况往往只能获得部分信息. 针对离散概率具有一类线性部分信息条件而建立了带有MaxEMin评判的两阶段随机规划模型, 借助二次规划和对偶分解方法得到了可行性切割和最优切割, 给出了基于L-型的求解算法, 并证明了算法的收敛性. 通过数值实验表明了算法的有效性.     

In the determination of weight sets to compute cross-efficiency ratios in DEA

Data envelopment analysis (DEA) measures the production performance of decision-making units (DMUs) which consume multiple inputs and produce multiple outputs. Although DEA has become a very popular method of performance measure, it still suffers from some shortcomings. For instance, one of its drawbacks is that multiple solutions exist in the linear programming solutions of efficient DMUs. The obtained weight set is just one of the many optimal weight sets that are available. Then why use this weight set instead of the others especially when this weight set is used for cross-evaluation? Another weakness of DEA is that extremely diverse or unusual values of some input or output weights might be obtained for DMUs under assessment. Zero input and output weights are not uncommon in DEA. The main objective of this paper is to develop a new methodology which applies discriminant analysis, super-efficiency DEA model and mixed-integer linear programming to choose suitable weight sets to be used in computing cross-evaluation. An advantage of this new method is that each obtained weight set can reflect the relative strengths of the efficient DMU under consideration. Moreover, the method also attempts to preserve the original classificatory result of DEA, and in addition this method produces much less zero weights than DEA in our computational results.     

A new framework for the solution of DEA models

We provide an alternative framework for solving data envelopment analysis (DEA) models which, in comparison with the standard linear programming (LP) based approach that solves one LP for each decision making unit (DMU), delivers much more information. By projecting out all the variables which are common to all LP runs, we obtain a formula into which we can substitute the inputs and outputs of each DMU in turn in order to obtain its efficiency number and all possible primal and dual optimal solutions. The method of projection, which we use, is Fourier–Motzkin (F–M) elimination. This provides us with the finite number of extreme rays of the elimination cone. These rays give the dual multipliers which can be interpreted as weights which will apply to the inputs and outputs for particular DMUs. As the approach provides all the extreme rays of the cone, multiple sets of weights, when they exist, are explicitly provided. Several applications are presented. It is shown that the output from the F–M method improves on existing methods of (i) establishing the returns to scale status of each DMU, (ii) calculating cross-efficiencies and (iii) dealing with weight flexibility. The method also demonstrates that the same weightings will apply to all DMUs having the same comparators. In addition it is possible to construct the skeleton of the efficient frontier of efficient DMUs. Finally, our experiments clearly indicate that the extra computational burden is not excessive for most practical problems.     

求解弱线性双层规划问题的一种全局优化方法

双层规划在经济、交通、生态、工程等领域有着广泛而重要的应用.目前对双层规划的研究主要是基于强双层规划和弱双层规划.然而,针对弱双层规划的求解方法却鲜有研究.研究求解弱线性双层规划问题的一种全局优化方法,首先给出弱线性双层规划问题与其松弛问题在最优解上的关系,然后利用线性规划的对偶理论和罚函数方法,讨论该松弛问题和它的罚问题之间的关系.进一步设计了一种求解弱线性双层规划问题的全局优化方法,该方法的优势在于它仅仅需要求解若干个线性规划问题就可以获得原问题的全局最优解.最后,用一个简单算例说明了所提出的方法是可行的.     

A new algorithm for geometric programming based on the linear structure of its dual problem

In this article, we present an algorithm for the resolution of a nonlinear optimization problem, concretely the posynomial geometric programming model. The solution procedure that we develop extends the condensation techniques for geometric programming, allowing us to find the optimal solutions to the dual geometric problems that we get from the interior of the corresponding feasible regions, in the line that interior point methods for linear programming work, which leads us to obtain considerable computational advantages with respect of the classical solution procedures.     

最小交互熵在投入─产出表理论预测的应用

本文利用最小交互熵的概念和有关结论，直接地给出具有固定边际的投入─产出表预测模型的ＲＡＳ方法的结构形式；同时利用信息论中的不等式，直接地证明最小交互熵解就是对偶几何规划解；从而简单、明了地赋于投入─产出表ＲＡＳ方法的信息意义．我们还给出一种迭代计算方案．最后指出，该方法可以用统计方法检验新的理论预测与原投入─产出表的差异性．     

A convergent criss-cross method

Our paper presents a new Criss-Cross method for solving linear programming problems. Starting from a neither primal nor dual feasible solution, we reach an optimal solution in finite number of steps if it exists. If there is no optimal solution, then we show that there is not primal feasible or dual feasible solution, We prove the finiteness of this procedure. Our procedure is not the same as the primal or dual simplex method if we have a primal or dual feasible solution, so we have constructed a quite new procedure for solving linear programming problems.