{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:51:29Z","timestamp":1752461489910},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1986,11,1]],"date-time":"1986-11-01T00:00:00Z","timestamp":531187200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1986,11]]},"DOI":"10.1007\/bf01840455","type":"journal-article","created":{"date-parts":[[2005,7,13]],"date-time":"2005-07-13T17:29:13Z","timestamp":1121275753000},"page":"409-424","source":"Crossref","is-referenced-by-count":108,"title":["An extension of Karmarkar's algorithm for linear programming using dual variables"],"prefix":"10.1007","volume":"1","author":[{"given":"Michael J.","family":"Todd","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce P.","family":"Burrell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01840455_CR1","volume-title":"Analysis of Karmarkar's algorithm for fractional linear programming, Manuscript","author":"K. M. Anstreicher","year":"1985","unstructured":"K. M. Anstreicher, Analysis of Karmarkar's algorithm for fractional linear programming, Manuscript, School of Organization and Management, Yale University, New Haven, CT, 1985."},{"key":"BF01840455_CR2","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/nav.3800090303","volume":"9","author":"A. Charnes","year":"1962","unstructured":"A. Charnes and W. W. Cooper, Programming with linear fraction functionals,Naval Res. Logist. Quart.,9 (1962), 181\u2013186.","journal-title":"Naval Res. Logist. Quart."},{"key":"BF01840455_CR3","volume-title":"An explicit solution sequence and convergence of Karmarkar's algorithm, Manuscript","author":"A. Charnes","year":"1984","unstructured":"A. Charnes, T. Song, and M. Wolfe, An explicit solution sequence and convergence of Karmarkar's algorithm, Manuscript, University of Texas at Austin, Austin, TX, 1984."},{"key":"BF01840455_CR4","volume-title":"Linear Programming","author":"V. Chvatal","year":"1983","unstructured":"V. Chvatal,Linear Programming, Freeman: New York and San Francisco, 1983."},{"key":"BF01840455_CR5","volume-title":"The logarithmic potential method of convex programming, unpublished","author":"K. R. Frisch","year":"1955","unstructured":"K. R. Frisch, The logarithmic potential method of convex programming, unpublished, University Institute of Economics, Oslo, 1955."},{"key":"BF01840455_CR6","volume-title":"A variant of Karmarkar's linear programming algorithm for problems in standard form, Manuscript","author":"D. Gay","year":"1985","unstructured":"D. Gay, A variant of Karmarkar's linear programming algorithm for problems in standard form, Manuscript, AT&T Bell Laboratories, Murray Hill, NJ, 1985."},{"key":"BF01840455_CR7","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/0024-3795(80)90159-7","volume":"34","author":"A. George","year":"1980","unstructured":"A. George and M. T. Heath, Solution of sparse linear least squares problems using Givens rotations,Linear Algebra Appl.,34 (1980), 69\u201383.","journal-title":"Linear Algebra Appl."},{"key":"BF01840455_CR8","doi-asserted-by":"crossref","DOI":"10.21236\/ADA158212","volume-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Manuscript","author":"P. E. Gill","year":"1985","unstructured":"P. E. Gill, W. Murray, M. E. Saunders, J. A. Tomlin, and M. H. Wright, On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method, Manuscript, Department of Operations Research, Stanford University, Stanford, CA, 1985."},{"key":"BF01840455_CR9","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1983","unstructured":"G. H. Golub and C. F. Van Loan,Matrix Computations, The Johns Hopkins Press, Baltimore, 1983."},{"key":"BF01840455_CR10","volume-title":"A conical projection algorithm for linear programming, Manuscript","author":"C. Gonzaga","year":"1985","unstructured":"C. Gonzaga, A conical projection algorithm for linear programming, Manuscript, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, 1985."},{"key":"BF01840455_CR11","volume-title":"The simplex method is very good! On the expected number of pivot stops and related properties of random linear programs, Manuscript","author":"M. Haimovich","year":"1983","unstructured":"M. Haimovich, The simplex method is very good! On the expected number of pivot stops and related properties of random linear programs, Manuscript, Graduate School of Business, Columbia University, New York, 1983."},{"key":"BF01840455_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/0903014","volume":"3","author":"M. Heath","year":"1982","unstructured":"M. Heath, Some extensions of an algorithm for sparse linear least squares problems,SIAM J. Sci. Statist. Comput.,3 (1982), 223\u2013237.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"BF01840455_CR13","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, Resolution of mathematical programming with nonlinear constraints by the method of centers, inNonlinear Programming (J. Abadie, ed.), North-Holland, Amsterdam, 1967, pp. 207\u2013219."},{"key":"BF01840455_CR14","volume-title":"Private communication","author":"D. Jensen","year":"1985","unstructured":"D. Jensen and A. Steger, Private communication, Department of Applied Mathematics and Statistics, State University of New York at Stonybrook, Stonybrook, New York, 1985."},{"key":"BF01840455_CR15","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01588963","volume":"14","author":"M. Kallio","year":"1978","unstructured":"M. Kallio and E. L. Porteus, A class of methods for linear programming,Math. Programming,14 (1978), 161\u201316.","journal-title":"Math. Programming"},{"key":"BF01840455_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar; A new polynomial time algorithm for linear programming,Combinatorica,4 (1984), 373\u2013395.","journal-title":"Combinatorica"},{"key":"BF01840455_CR17","volume-title":"A variation on Karmarkar's Algorithm, Manuscript","author":"N. Megiddo","year":"1985","unstructured":"N. Megiddo, A variation on Karmarkar's Algorithm, Manuscript, IBM Research Laboratory, San Jose, CA, 1985."},{"key":"BF01840455_CR18","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF00933128","volume":"20","author":"M. J. Todd","year":"1976","unstructured":"M. J. Todd, Extensions of Lemke's algorithm for the linear complementarity problem,J. Optim. Theory Appl.,20 (1976), 397\u2013416.","journal-title":"J. Optim. Theory Appl."},{"key":"BF01840455_CR19","volume-title":"Manuscript","author":"J. A. Tomlin","year":"1985","unstructured":"J. A. Tomlin, An experimental approach to Karmarkar's projective method for linear programming, Manuscript, Ketron Inc., Mountain View, CA, 1985."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840455.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01840455\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01840455","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T15:35:32Z","timestamp":1557416132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01840455"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,11]]},"references-count":19,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1986,11]]}},"alternative-id":["BF01840455"],"URL":"https:\/\/doi.org\/10.1007\/bf01840455","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,11]]}}}