{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:01:44Z","timestamp":1787313704539,"version":"build-2736575974"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1989,1]]},"DOI":"10.1007\/bf01582293","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:32:42Z","timestamp":1114662762000},"page":"257-276","source":"Crossref","is-referenced-by-count":32,"title":["An interior point algorithm for semi-infinite linear programming"],"prefix":"10.1007","volume":"43","author":[{"given":"M. C.","family":"Ferris","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. B.","family":"Philpott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga. \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201d Department of Industrial Engineering and Operations Research, University of California, Berkeley, CA 94720."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E.R. Barnes","year":"1986","unstructured":"E.R. Barnes. \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1986) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR3","series-title":"ISME Working Paper","volume-title":"Some Computational Experience and a Modification of the Karmarkar Algorithm","author":"T.M. Cavalier","year":"1985","unstructured":"T.M. Cavalier and A.L. Soyster, \u201cSome Computational Experience and a Modification of the Karmarkar Algorithm,\u201d ISME Working Paper 85\u2013105, Pennsylvania State University, Pennsylvania (1985)."},{"issue":"3","key":"CR4","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems of linear and quadratic programming,\u201dSoviet Mathematics Doklady 8(3) (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1142-6","volume-title":"Linear Optimization and Approximation","author":"K. Glashoff","year":"1983","unstructured":"K. Glashoff and S.-\u00c5. Gustafson,Linear Optimization and Approximation (Springer-Verlag, New York, 1983)."},{"key":"CR6","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1983","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations (The John Hopkins University Press, Baltimore, Maryland, 1983)."},{"key":"CR7","volume-title":"Semi-Infinite Programming","author":"S.-\u00c5. Gustafson","year":"1979","unstructured":"S.-\u00c5. Gustafson. \u201cOn numerical analysis in semi-infinite programming,\u201d in: R. Hettich, ed.,Semi-Infinite Programming (Springer-Verlag, Berlin, 1979)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR9","series-title":"Working Paper","volume-title":"Vector-Supercomputer Experiments with the Linear Programming Scaling Algorithm","author":"K.O. Kortanek","year":"1987","unstructured":"K.O. Kortanek. \u201cVector-Supercomputer Experiments with the Linear Programming Scaling Algorithm,\u201d Working Paper 87-2, College of Business Adminstration, University of Iowa, Iowa City (1987)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0377-2217(87)90270-0","volume":"32","author":"K.O. Kortanek","year":"1987","unstructured":"K.O. Kortanek and M. Shi. \u201cConvergence results and numerical experiments on a linear programming hybrid algorithm,\u201dEuropean Journal of Operational Research 32 (1987) 47\u201361.","journal-title":"European Journal of Operational Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","volume":"1","author":"R.J. Vanderbei","year":"1986","unstructured":"R.J. Vanderbei, M.S. Meketon and B.A. Freedman, \u201cA modification of Karmarkar's algorithm,\u201dAlgorithmica 1 (1986) 395\u2013407.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582293.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582293\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:15:48Z","timestamp":1556882148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,1]]},"references-count":11,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,1]]}},"alternative-id":["BF01582293"],"URL":"https:\/\/doi.org\/10.1007\/bf01582293","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,1]]}}}