{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,13]],"date-time":"2025-09-13T15:57:38Z","timestamp":1757779058193},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"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":[[1987,2]]},"DOI":"10.1007\/bf02591685","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T11:42:31Z","timestamp":1175168551000},"page":"81-90","source":"Crossref","is-referenced-by-count":94,"title":["A variant of Karmarkar's linear programming algorithm for problems in standard form"],"prefix":"10.1007","volume":"37","author":[{"given":"David M.","family":"Gay","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02591685_CR1","doi-asserted-by":"crossref","unstructured":"K. Anstreicher, \u201cA monotonic projective algorithm for fractional linear programming\u201d, manuscript, School of Organization and Management Yale University (March 1986).","DOI":"10.1007\/BF01840458"},{"key":"BF02591685_CR2","unstructured":"J.E. Dennis, Jr., A.M. Morshedi and K. Turner. \u201cA variable metric variant of the Karmarkar algorithm for linear programming,\u201d Technical Report 86-13, Department of Mathematical Sciences, Rice University, June 1986."},{"key":"BF02591685_CR3","unstructured":"D. Goldfarb and S. Mehrotra, \u201cA relaxed version of Karmarkar's method,\u201d manuscript, School of Engineering and Applied Science, Columbia University (December 1985)."},{"key":"BF02591685_CR4","series-title":"Memorandum UCB\/ERL M85\/61","volume-title":"A conical projection algorithm for linear programming","author":"C. Gonzaga","year":"1985","unstructured":"C. Gonzaga, \u201cA conical projection algorithm for linear programming,\u201d Memorandum UCB\/ERL M85\/61, Department of Electrical Engineering and Computer Science, University of California, Berkeley (July 1985)."},{"key":"BF02591685_CR5","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":"BF02591685_CR6","unstructured":"I.J. Lustig, \u201cA practical approach, to Kramarkar's algorithm,\u201d Technical Report SOL 85-5, Systems Optimization Laboratory, Department of Operations Research Stanford University (June 1985)."},{"key":"BF02591685_CR7","unstructured":"A.E. Steger, \u201cAn extension of Karmarkar's algorithm for bounded linear programming problems,\u201d M.S. thesis, State University of New York at Stony Brook (August 1985)."},{"key":"BF02591685_CR8","unstructured":"M. J. Todd and B. P. Burrell, \u201cAn extension of Karmarkar's algorithm for linear programming using dual variables,\u201d Technical Report 648, School of Operations Research and Industrial Engineering, Cornell University (January 1985)."},{"key":"BF02591685_CR9","unstructured":"J.A. Tomlin, \u201cAn experimental approach to Karmarkar's projective method for linear programming,\u201d manuscript, Ketron Incorporated (January 1985)."},{"key":"BF02591685_CR10","unstructured":"Y. Ye., \u201cCutting objective and scaling methods\u2014A \u2018simple\u2019 polynomial algorithm for linear programming,\u201d manuscript, Engineering-Economic Systems Department, Stanford University (August 1985)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591685.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02591685\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02591685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T19:37:48Z","timestamp":1558381068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02591685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":10,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["BF02591685"],"URL":"https:\/\/doi.org\/10.1007\/bf02591685","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}