DEA 模型(C^2R 模型,C^2GS^2模型,C^2W 模型和 C^2WH 模型等)是用来评价决策单元之间的相对有效性的.本文将给出关于具有更一般形式的综合 DEA 模型中的 DEA 有效决策单元集合的几个恒等式.这些等式表明在评价相对有效性时,可以将决策...DEA 模型(C^2R 模型,C^2GS^2模型,C^2W 模型和 C^2WH 模型等)是用来评价决策单元之间的相对有效性的.本文将给出关于具有更一般形式的综合 DEA 模型中的 DEA 有效决策单元集合的几个恒等式.这些等式表明在评价相对有效性时,可以将决策单元按照实际情况进行分组,先评价组内决策单元之间的相对有效性,再利用得到的信息进行不同组之间的有效决策单元的效率评价,如此等等.展开更多
A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems....A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.展开更多
众所周知,最优性条件的讨论在最优化理论中占有十分重要的地位,尤其是带约束的一般的极值问题(P)的高阶最优性条件的讨论更引人注目,例如 K.H.Hoffman andH.J.Cornstaedt及A.Linnemann借助于高阶变分集合;F.Lempio and J.Zowem利用像空...众所周知,最优性条件的讨论在最优化理论中占有十分重要的地位,尤其是带约束的一般的极值问题(P)的高阶最优性条件的讨论更引人注目,例如 K.H.Hoffman andH.J.Cornstaedt及A.Linnemann借助于高阶变分集合;F.Lempio and J.Zowem利用像空间中的高阶凸逼近; B.展开更多
文摘DEA 模型(C^2R 模型,C^2GS^2模型,C^2W 模型和 C^2WH 模型等)是用来评价决策单元之间的相对有效性的.本文将给出关于具有更一般形式的综合 DEA 模型中的 DEA 有效决策单元集合的几个恒等式.这些等式表明在评价相对有效性时,可以将决策单元按照实际情况进行分组,先评价组内决策单元之间的相对有效性,再利用得到的信息进行不同组之间的有效决策单元的效率评价,如此等等.
基金Projects(50275150,61173052) supported by the National Natural Science Foundation of ChinaProject(14FJ3112) supported by the Planned Science and Technology of Hunan Province,ChinaProject(14B033) supported by Scientific Research Fund Education Department of Hunan Province,China
文摘A novel chaotic search method is proposed,and a hybrid algorithm combining particle swarm optimization(PSO) with this new method,called CLSPSO,is put forward to solve 14 integer and mixed integer programming problems.The performances of CLSPSO are compared with those of other five hybrid algorithms combining PSO with chaotic search methods.Experimental results indicate that in terms of robustness and final convergence speed,CLSPSO is better than other five algorithms in solving many of these problems.Furthermore,CLSPSO exhibits good performance in solving two high-dimensional problems,and it finds better solutions than the known ones.A performance index(PI) is introduced to fairly compare the above six algorithms,and the obtained values of(PI) in three cases demonstrate that CLSPSO is superior to all the other five algorithms under the same conditions.
基金The work is supported by the Foundation of Natural Science China (grants 10271073) the Natural Science Foundation of National Committee in China in 2005.
文摘众所周知,最优性条件的讨论在最优化理论中占有十分重要的地位,尤其是带约束的一般的极值问题(P)的高阶最优性条件的讨论更引人注目,例如 K.H.Hoffman andH.J.Cornstaedt及A.Linnemann借助于高阶变分集合;F.Lempio and J.Zowem利用像空间中的高阶凸逼近; B.