2026-03-06T04:59:56Z https://grips.repo.nii.ac.jp/oai

oai:grips.repo.nii.ac.jp:00001366 2023-12-14T04:14:53Z 52:53

A Computational Method for Solving DEA Problems with Infinitely Many DMUs CHARNES, A. TONE, Kaoru 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. Reprinted from Research Report CCS 561, Center for Cybernetic Studies, The University of Texas, at Austin. departmental bulletin paper Technology Policy Science, Saitama Univ 1987-03-24 AM application/pdf Institute for Policy Science research report. B B-3 87 https://grips.repo.nii.ac.jp/record/1366/files/87-B-3.pdf https://grips.repo.nii.ac.jp/records/1366 eng