WEKO3
アイテム
A Computational Method for Solving DEA Problems with Infinitely Many DMUs
https://grips.repo.nii.ac.jp/records/1366
https://grips.repo.nii.ac.jp/records/1366c44efe4b-2853-4cda-8627-6b30ce31032e
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
87-B-3.pdf (210.2 kB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| 公開日 | 2016-04-13 | |||||||||
| タイトル | ||||||||||
| タイトル | A Computational Method for Solving DEA Problems with Infinitely Many DMUs | |||||||||
| 言語 | en | |||||||||
| 言語 | ||||||||||
| 言語 | eng | |||||||||
| 資源タイプ | ||||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||||
| 資源タイプ | departmental bulletin paper | |||||||||
| 著者 |
CHARNES, A.
× CHARNES, A.
× TONE, Kaoru
|
|||||||||
| 著者別名 | ||||||||||
| 識別子Scheme | WEKO | |||||||||
| 識別子 | 7856 | |||||||||
| 姓名 | 刀根, 薫 | |||||||||
| 言語 | ja | |||||||||
| 抄録 | ||||||||||
| 内容記述タイプ | Abstract | |||||||||
| 内容記述 | Semi-infinite programs as related to DEA with infinitely many DMUs will be solved by bisections within the framework of LPs. No gradient Information Is needed, contrary to the usual Newton-Raphson type methods for solving semi-Infinite programs. The rate of convergence is linear. The method has a stable convergency feature derived from the bisection rule. |
|||||||||
| 内容記述 | ||||||||||
| 内容記述タイプ | Other | |||||||||
| 内容記述 | Reprinted from Research Report CCS 561, Center for Cybernetic Studies, The University of Texas, at Austin. | |||||||||
| 書誌情報 |
en : Institute for Policy Science research report. B 巻 87, 号 B-3, 発行日 1987-03-24 |
|||||||||
| 出版者 | ||||||||||
| 出版者 | Technology Policy Science, Saitama Univ | |||||||||
| 言語 | en | |||||||||
| 著者版フラグ | ||||||||||
| 出版タイプ | AM | |||||||||
| 出版タイプResource | http://purl.org/coar/version/c_ab4af688f83e57aa | |||||||||
| 著者情報 | ||||||||||
| 表示名 | https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/ | |||||||||
| URL | https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/ | |||||||||
