{"created":"2021-03-01T07:09:47.261071+00:00","id":48965,"links":{},"metadata":{"_buckets":{"deposit":"26139259-14c3-4b7d-8ca3-3950918e5864"},"_deposit":{"id":"48965","owners":[],"pid":{"revision_id":0,"type":"depid","value":"48965"},"status":"published"},"_oai":{"id":"oai:repository.dl.itc.u-tokyo.ac.jp:00048965","sets":["34:95:96","9:10:15"]},"item_2_biblio_info_7":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicIssueDates":{"bibliographicIssueDate":"1991-04-25","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"4","bibliographicPageEnd":"671","bibliographicPageStart":"669","bibliographicVolumeNumber":"E74-A","bibliographic_titles":[{"bibliographic_title":"IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences"}]}]},"item_2_description_5":{"attribute_name":"抄録","attribute_value_mlt":[{"subitem_description":"The paper proves the polynomiality of the multiplicative penalty function method for linear programming proposed by Iri and Imai. This is accomplished by considering ellipsoids determined by the Hessian at an interior point and centered at the point, and showing that, for any interior point, there is such an ellipsoid contained in the feasible region in which the penalty function is well approximated by a linear function determined by the gradient at the point.","subitem_description_type":"Abstract"}]},"item_2_description_6":{"attribute_name":"内容記述","attribute_value_mlt":[{"subitem_description":"Special Section PAPER (Special Issue on Discrete Mathematics and Its Applications)","subitem_description_type":"Other"}]},"item_2_publisher_20":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"Institute of Electronics, Information and Communication Engineers"}]},"item_2_relation_25":{"attribute_name":"関係URI","attribute_value_mlt":[{"subitem_relation_type_id":{"subitem_relation_type_id_text":"https://search.ieice.org/","subitem_relation_type_select":"URI"}}]},"item_2_rights_12":{"attribute_name":"権利","attribute_value_mlt":[{"subitem_rights":"copyright©1991 IEICE"}]},"item_2_select_14":{"attribute_name":"著者版フラグ","attribute_value_mlt":[{"subitem_select_item":"publisher"}]},"item_2_text_4":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"Faculty of Science, University of Tokyo"}]},"item_creator":{"attribute_name":"著者","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"IMAI, Hiroshi"}],"nameIdentifiers":[{"nameIdentifier":"145499","nameIdentifierScheme":"WEKO"}]}]},"item_files":{"attribute_name":"ファイル情報","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_date","date":[{"dateType":"Available","dateValue":"2017-12-15"}],"displaytype":"detail","filename":"On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids 1991.pdf","filesize":[{"value":"189.3 kB"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"label":"On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids 1991.pdf","url":"https://repository.dl.itc.u-tokyo.ac.jp/record/48965/files/On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids 1991.pdf"},"version_id":"e5f56c35-df2b-472d-a259-e5a608028734"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"eng"}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourcetype":"journal article","resourceuri":"http://purl.org/coar/resource_type/c_6501"}]},"item_title":"On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids","item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids"}]},"item_type_id":"2","owner":"1","path":["15","96"],"pubdate":{"attribute_name":"公開日","attribute_value":"2017-12-14"},"publish_date":"2017-12-14","publish_status":"0","recid":"48965","relation_version_is_last":true,"title":["On the Polynomiality of the Multiplicative Penalty Function Method for Linear Programming and Related Inscribed Ellipsoids"],"weko_creator_id":"1","weko_shared_id":null},"updated":"2022-12-19T04:23:38.426133+00:00"}