{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T04:29:17Z","timestamp":1779337757938,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"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":[[1991,5]]},"DOI":"10.1007\/bf01582905","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:11Z","timestamp":1114677311000},"page":"555-586","source":"Crossref","is-referenced-by-count":61,"title":["Computational results of an interior point algorithm for large scale linear programming"],"prefix":"10.1007","volume":"52","author":[{"given":"N. K.","family":"Karmarkar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. G.","family":"Ramakrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, \u201cAn implementation of Karmarkar algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013335.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","unstructured":"I. Adler, N.K. Karmarkar, M.G.C. Resende and G. Veiga, \u201cData structures and programming techniques for the implementation of Karmarkar's algorithm,\u201dORSA Journal of Computing 1(2) (1989).","DOI":"10.1287\/ijoc.1.2.84"},{"key":"CR3","volume-title":"\u201cA polynomial time version of the affine scaling algorithm,\u201d Technical Report No. 88-101","author":"E.R. Barnes","year":"1988","unstructured":"E.R. Barnes, S. Chopra and D.L. Jensen, \u201cA polynomial time version of the affine scaling algorithm,\u201d Technical Report No. 88-101, Graduate School of Business Administration, New York University (Washington Square, NY, 1988)."},{"key":"CR4","first-page":"499","volume":"314","author":"D.A. Bayer","year":"1989","unstructured":"D.A. Bayer and J.C. Lagarias, \u201cThe nonlinear geometry of linear programming I, affine and projective scaling trajectories,\u201dTransactions of the American Mathematical Society 314 (1989) 499\u2013526.","journal-title":"Transactions of the American Mathematical Society"},{"key":"CR5","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and Hypergraphs (North-Holland, New York, 1973)."},{"key":"CR6","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-105, The Pennsylvania State University (University Park, PA, 1985)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"Y.C. Cheng, D.J. Houck Jr., J.M. Liu, M.S. Meketon, L. Slutsman, R.J. Vanderbei and P. Wang, \u201cThe AT&T KORBX(TM) system,\u201dAT&T Technical Journal (1989).","DOI":"10.1002\/j.1538-7305.1989.tb00315.x"},{"key":"CR8","volume-title":"Computer-Aided Transit-scheduling: Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, 1987","year":"1988","unstructured":"J.R. Daduna and A. Wren, eds.,Computer-Aided Transit-scheduling: Proceedings of the Fourth International Workshop on Computer-Aided Scheduling of Public Transport, Hamburg, Germany, 1987 (Springer, New York, 1988)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02592068","volume":"39","author":"J.E. Dennis Jr.","year":"1987","unstructured":"J.E. Dennis Jr., A.M. Morshedi and K. Turner, \u201cA variable-metric variant of the Karmarkar algorithm for linear programming,\u201dMathematical Programming 39 (1987) 1\u201320.","journal-title":"Mathematical Programming"},{"key":"CR10","first-page":"674","volume":"8","author":"I.I. Dikin","year":"1967","unstructured":"I.I. Dikin, \u201cIterative solution of problems in linear and quadratic programming,\u201dSoviet Mathematics Doklady 8 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR11","first-page":"54","volume":"12","author":"I.I. Dikin","year":"1974","unstructured":"I.I. Dikin, \u201cOn the convergence of an iterative process,\u201dUpravlyaeye Sistemi 12 (1974) 54\u201360. [In Russian.]","journal-title":"Upravlyaeye Sistemi"},{"key":"CR12","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford Jr. and D.R. Fulkerson,Flows in Networks (Princeton University Press, Princeton, NJ, 1962)."},{"key":"CR13","volume-title":"Adaptive least squares optimization subject to linear equality constraints","author":"O.L. Frost","year":"1970","unstructured":"O.L. Frost, \u201cAdaptive least squares optimization subject to linear equality constraints,\u201d Ph.D. Thesis, Stanford University (Stanford, CA, 1970)."},{"key":"CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979)."},{"key":"CR15","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society Committee on Algorithms Newsletter 13 (1985) 10\u201312.","journal-title":"Mathematical Programming Society Committee on Algorithms Newsletter"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF02592025","volume":"36","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, \u201cOn projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method,\u201dMathematical Programming 36 (1986) 183\u2013209.","journal-title":"Mathematical Programming"},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1002\/net.3230040302","volume":"4","author":"F. Glover","year":"1974","unstructured":"F. Glover, D. Karney and D. Klingmen, \u201cImplementation and computational comparisons of primal, dual, and primal\u2014dual computer codes for minimum cost network flow problems,\u201dNetworks 4(3) (1974) 191\u2013212.","journal-title":"Networks"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF01580729","volume":"40","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and S. Mehrotra, \u201cRelaxed variants of Karmarkar's algorithm for linear programs with unknown objective value,\u201dMathematical Programming 40 (1988) 183\u2013195.","journal-title":"Mathematical Programming"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01580737","volume":"40","author":"D. Goldfarb","year":"1988","unstructured":"D. Goldfarb and S. Mehrotra, \u201cA relaxed version of Karmarkar's method,\u201dMathematical Programming 40 (1988) 289\u2013315.","journal-title":"Mathematical Programming"},{"key":"CR20","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Laon,Matrix Computations (The Johns Hopkins University Press, Baltimore, MD, 1989, 2nd ed.).","edition":"2nd ed."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02932410","volume":"25","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOptimal triangulation of large real world input\u2014output matrices,\u201dStatistische Hefte 25 (1984) 261\u2013295.","journal-title":"Statistische Hefte"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"M. Gr\u00f6tschel, M. J\u00fcnger and G. Reinelt, \u201cOn the acyclic subgraph polytope,\u201dMathematical Programming 33 (1985) 28\u201342.","journal-title":"Mathematical Programming"},{"key":"CR23","volume-title":"Introduction to Numerical Analysis","author":"F.B. Hildebrand","year":"1974","unstructured":"F.B. Hildebrand,Introduction to Numerical Analysis (McGraw-Hill, New York, 1974, 2nd ed.).","edition":"2nd ed."},{"key":"CR24","volume-title":"Linear Systems","author":"T. Kailath","year":"1980","unstructured":"T. Kailath,Linear Systems (Prentice Hall, Englewood Cliffs, NJ, 1980)."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N.K. Karmarkar","year":"1984","unstructured":"N.K. Karmarkar, \u201cA new polynomial time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR26","doi-asserted-by":"crossref","unstructured":"N.K. Karmarkar and K.G. Ramakrishnan, \u201cFurther developments in the new polynomial-time algorithm for linear programming,\u201d Talk given atORSA\/TIMS Conference (Boston, MA, 1985).","DOI":"10.1145\/800057.808695"},{"key":"CR27","doi-asserted-by":"crossref","unstructured":"N.K. Karmarkar and K.G. Ramakrishnan, \u201cFurther developments in the new polynomial-time algorithm for linear programming,\u201d Talk given at the12th International Symposium on Mathematical Programming (Boston, MA, 1985).","DOI":"10.1145\/800057.808695"},{"key":"CR28","unstructured":"N.K. Karmarkar and K.G. Ramakrishnan, \u201cImplementation and computational results of the Karmarkar algorithm for linear programming using an iterative method of computing projections,\u201d AT&T Bell Laboratories Technical Memorandum No. 11211-891011-10TM (1989)."},{"key":"CR29","unstructured":"N.K. Karmarkar and L.P. Sinha, \u201cApplication of Karmarkar's algorithm to overseas telecommunications facilities planning,\u201d Talk given at the12th International Symposium on Mathematical Programming (Boston, MA, 1985)."},{"key":"CR30","volume-title":"Algorithms for Network Programming","author":"J.L. Kennington","year":"1980","unstructured":"J.L. Kennington and R.V. Helgason,Algorithms for Network Programming (Wiley, New York, 1980)."},{"key":"CR31","first-page":"191","volume":"20","author":"L.G. Khachian","year":"1979","unstructured":"L.G. Khachian, \u201cA polynomial time algorithm in linear programming,\u201dSoviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1090\/psapm\/015\/0161746","volume-title":"Experimental Arithmetic, High Speed Computing, and Mathematics, Proceedings of Symposia in Applied Mathematics XVi","author":"H.W. Kuhn","year":"1963","unstructured":"H.W. Kuhn and R.E. Quandt, \u201cAn experimental study of the simplex method,\u201d in: N.C. Metropolis et al., eds.,Experimental Arithmetic, High Speed Computing, and Mathematics, Proceedings of Symposia in Applied Mathematics XV i (American Mathematical Society, Providence, RI, 1963) pp. 107\u2013124."},{"key":"CR33","volume-title":"Linear and Nonlinear Programming","author":"D.G. Luenberger","year":"1984","unstructured":"D.G. Luenberger,Linear and Nonlinear Programming (Addison-Wesley, Reading, MA, 1984, 2nd ed.).","edition":"2nd ed."},{"key":"CR34","volume-title":"\u201cAn analysis of available set of linear programming test problems,\u201d Technical Report SOL 87-11","author":"I.J. Lustig","year":"1987","unstructured":"I.J. Lustig, \u201cAn analysis of available set of linear programming test problems,\u201d Technical Report SOL 87-11, Systems Optimization Laboratory, Stanford University (Stanford, CA, 1987)."},{"key":"CR35","volume-title":"\u201cComputational experience with a primal\u2014dual interior-point method for linear programming,\u201d Technical Report SOR 89-17","author":"I.J. Lustig","year":"1989","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cComputational experience with a primal\u2014dual interior-point method for linear programming,\u201d Technical Report SOR 89-17, Department of Civil Engineering and Operations Research, Princeton University (Princeton, NJ, 1989)."},{"key":"CR36","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0167-6377(87)90040-X","volume":"6","author":"C.L. Monma","year":"1987","unstructured":"C.L. Monma and A.J. Morton, \u201cComputational experience with a dual variant of Karmarkar's method for linear programming,\u201dOperations Research Letters 6 (1987) 261\u2013267.","journal-title":"Operations Research Letters"},{"key":"CR37","volume-title":"\u201cMinos 5.1 user's guide,\u201d Technical Report SOL 83-20R","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMinos 5.1 user's guide,\u201d Technical Report SOL 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1983, revised 1987)."},{"key":"CR38","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/355984.355989","volume":"8","author":"C.C. Paige","year":"1982","unstructured":"C.C. Paige and M.A. Saunders, \u201cLSQR: An algorithm for sparse linear equations and sparse least squares,\u201dACM Transactions on Mathematical Software 8 (1982) 43\u201371.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR39","unstructured":"M. Saunders, Private communication to David Gay (1988)."},{"key":"CR40","unstructured":"Scientific Computing Associates,SMPAK User's Guide Version 1.0 (1985)."},{"key":"CR41","unstructured":"D. Shanno and C. Monma, \u201cComputational experience with the primal\u2014dual method,\u201d Talk presented at theORSA\/TIMS Conference (Washington, DC, 1988)."},{"key":"CR42","volume-title":"Overseas Network Planning-Application of Karmarkar's Algorithm, Proceedings of NETWORK'86 Conference","author":"L.P. Sinha","year":"1986","unstructured":"L.P. Sinha, B.A. Freedman, N.K. Karmarkar, A. Putcha and K.G. Ramakrishnan,Overseas Network Planning-Application of Karmarkar's Algorithm, Proceedings of NETWORK'86 Conference (Tarpon Springs, FL, 1986)."},{"key":"CR43","volume-title":"An Analysis of Finite Element Method","author":"G. Strang","year":"1973","unstructured":"G. Strang and G.J. Fix,An Analysis of Finite Element Method (Prentice-Hall, Englewood Cliffs, NJ, 1973)."},{"key":"CR44","unstructured":"Ultrix-32 Programmer's Manual, Digital Equipment Corporation (Mayward, MA, 1987)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:47:06Z","timestamp":1586231226000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":44,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["BF01582905"],"URL":"https:\/\/doi.org\/10.1007\/bf01582905","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}