{"created":"2023-06-20T15:03:18.712013+00:00","id":1366,"links":{},"metadata":{"_buckets":{"deposit":"36b6dee5-d0ee-45a9-bf12-03983cfa08e6"},"_deposit":{"created_by":16,"id":"1366","owners":[16],"pid":{"revision_id":0,"type":"depid","value":"1366"},"status":"published"},"_oai":{"id":"oai:grips.repo.nii.ac.jp:00001366","sets":["52:53"]},"author_link":["7856","7854","7855"],"item_10002_biblio_info_31":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1987-03-24","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"B-3","bibliographicVolumeNumber":"87","bibliographic_titles":[{"bibliographic_title":"Institute for Policy Science research report. B","bibliographic_titleLang":"en"}]}]},"item_10002_description_29":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"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.\nThe rate of convergence is linear. The method has a stable convergency feature derived from the bisection rule.","subitem_description_type":"Abstract"}]},"item_10002_description_30":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Reprinted from Research Report CCS 561, Center for Cybernetic Studies, The University of Texas, at Austin.","subitem_description_type":"Other"}]},"item_10002_full_name_27":{"attribute_name":"著者別名","attribute_value_mlt":[{"nameIdentifiers":[{"nameIdentifier":"7856","nameIdentifierScheme":"WEKO"}],"names":[{"name":"刀根, 薫","nameLang":"ja"}]}]},"item_10002_link_46":{"attribute_name":"著者情報","attribute_value_mlt":[{"subitem_link_text":"https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/","subitem_link_url":"https://www.grips.ac.jp/list/facultyinfo/tone_kaoru/"}]},"item_10002_publisher_32":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Technology Policy Science, Saitama Univ","subitem_publisher_language":"en"}]},"item_10002_version_type_42":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_version_resource":"http://purl.org/coar/version/c_ab4af688f83e57aa","subitem_version_type":"AM"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"CHARNES, A.","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7854","nameIdentifierScheme":"WEKO"}]},{"creatorNames":[{"creatorName":"TONE, Kaoru","creatorNameLang":"en"}],"nameIdentifiers":[{"nameIdentifier":"7855","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","filename":"87-B-3.pdf","filesize":[{"value":"210.2 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"87-B-3.pdf","url":"https://grips.repo.nii.ac.jp/record/1366/files/87-B-3.pdf"},"version_id":"4e428939-282a-4475-a5c8-157226434f8a"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"departmental bulletin paper","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"A Computational Method for Solving DEA Problems with Infinitely Many DMUs","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"A Computational Method for Solving DEA Problems with Infinitely Many DMUs","subitem_title_language":"en"}]},"item_type_id":"10002","owner":"16","path":["53"],"pubdate":{"attribute_name":"PubDate","attribute_value":"2016-04-13"},"publish_date":"2016-04-13","publish_status":"0","recid":"1366","relation_version_is_last":true,"title":["A Computational Method for Solving DEA Problems with Infinitely Many DMUs"],"weko_creator_id":"16","weko_shared_id":-1},"updated":"2023-12-14T04:14:53.152371+00:00"}