{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:26:33Z","timestamp":1648751193757},"reference-count":16,"publisher":"Informa UK Limited","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1080\/10556780500098599","type":"journal-article","created":{"date-parts":[[2006,1,17]],"date-time":"2006-01-17T14:22:23Z","timestamp":1137507743000},"page":"419-443","source":"Crossref","is-referenced-by-count":2,"title":["Computation of condition numbers for linear programming problems using Pe\u00f1a\u2019s method"],"prefix":"10.1080","volume":"21","author":[{"given":"Joo-siong","family":"Chai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim-chuan","family":"Toh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"CIT0001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01581690"},{"key":"CIT0002","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623400373829"},{"key":"CIT0003","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050088"},{"key":"CIT0004","first-page":"1","volume":"83","author":"Nunez M. A.","year":"1998","journal-title":"Mathematical Programming"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623402401804"},{"key":"CIT0006","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623497323674"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1007\/s101070200294"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1007\/s101070050001"},{"key":"CIT0009","unstructured":"Pe\u00f1a, J. 1998. \u201cComputing the distance to infeasibility: theoretical and practical issues\u201d. Cornell University. Technical report, Center for Applied Mathematics"},{"key":"CIT0010","unstructured":"NETLIB linear programming library. Available online at:http:\/\/www.netlib.org\/lp\/. Accesssed Feb\u2013Mar 2003"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1287\/moor.22.1.1"},{"key":"CIT0012","first-page":"279","volume":"70","author":"Renegar J.","year":"1995","journal-title":"Mathematical Programming"},{"key":"CIT0013","volume-title":"Iterative Methods for Sparse Linear Systems","author":"Saad Y.","year":"1996"},{"key":"CIT0014","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971163","volume-title":"Symmetric Eigenvalue Problems","author":"Parlett B. N.","year":"1998"},{"key":"CIT0015","volume-title":"AMPL: A Modelling Language for Mathematical Programming","author":"Fourer R.","year":"1993"},{"key":"CIT0016","unstructured":"Vanderbei, R. J. 1999. \u201cLOQO User\u2019s Manual\u2013Version 4.05\u201d. Princeton University. Department of Operations Research and Financial Engineering"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780500098599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:57:36Z","timestamp":1555289856000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/10556780500098599"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["10.1080\/10556780500098599"],"URL":"https:\/\/doi.org\/10.1080\/10556780500098599","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}