| 两个DEA的逆问题的解法的探讨 |
| |
| 引用本文： | 吴文江. 两个DEA的逆问题的解法的探讨[J]. 运筹学学报, 2004, 8(2): 9-16 |
| |
| 作者姓名： | 吴文江 |
| |
| 作者单位： | 北京工业大学,管庄,北京,100024 |
| |
| 摘 要： | 文[1]提出了两个DEA的逆问题，并用搜索法来解．而本文根据所证的定理，对每个问题一般只要解二、三个线性规划问题就能得到答案．
|
| 关 键 词： | DEA 逆 搜索法 线性规划 运筹学 数据包络分析 决策单元 |
Discussion On Method to Solve Two Inverse Problems of DEA |
| |
| Abstract. Discussion On Method to Solve Two Inverse Problems of DEA[J]. OR Transactions, 2004, 8(2): 9-16 |
| |
| Authors: | Abstract |
| |
| Affiliation: | Guangzhuang |
| |
| Abstract: | In Ref. [1] two inverse problem of DEA was sugsested and solved by search method. But the result of each problem of them in this paper is obtained by only solving two or three linar programming problems in general on the basis of some theorems proved in the paper. |
| |
| Keywords: | OR data envelopment analysis (DEA) decision making unit (DMU) inverse problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
