{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T22:05:43Z","timestamp":1770501943828,"version":"3.49.0"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1990,11,1]],"date-time":"1990-11-01T00:00:00Z","timestamp":657417600000},"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":[[1990,11]]},"DOI":"10.1007\/bf01588785","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:19:53Z","timestamp":1114676393000},"page":"145-162","source":"Crossref","is-referenced-by-count":132,"title":["Feasibility issues in a primal-dual interior-point method for linear programming"],"prefix":"10.1007","volume":"49","author":[{"given":"Irvin J.","family":"Lustig","sequence":"first","affiliation":[]}],"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. Karmarkar, M.G.C. Resende and G. Veiga, \u201cAn implementation of Karmarkar's algorithm for linear programming,\u201dMathematical Programming 44 (1989) 297\u2013336.","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","volume":"36","author":"E. Barnes","year":"1985","unstructured":"E. Barnes, \u201cA variation on Karmarkar's algorithm for solving linear programming problems,\u201dMathematical Programming 36 (1985) 174\u2013182.","journal-title":"Mathematical Programming"},{"key":"CR3","volume-title":"Further development of a primal\u2014dual interior point method","author":"I.C. Choi","year":"1988","unstructured":"I.C. Choi, C.L. Monma and D.F. Shanno, \u201cFurther development of a primal\u2014dual interior point method,\u201d manuscript, Columbia University (New York, NY, 1988), to appear in:ORSA Journal on Computing."},{"key":"CR4","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig,Linear Programming and Extensions (Princeton University Press, Princeton, NJ, 1963)."},{"key":"CR5","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 (1967) 674\u2013675.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR6","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society COAL Newsletter (December, 1985)."},{"key":"CR7","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"J.A. George","year":"1981","unstructured":"J.A. George and J.W.H. Liu,Computer Solution of Large Sparse Positive Definite Systems (Prentice-Hall, Englewood Cliffs, NJ, 1981)."},{"key":"CR8","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"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1990","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, \u201cA practical anti-cycling procedure for linearly constrained optimization,\u201dMathematical Progamming 45 (1990) 437\u2013474.","journal-title":"Mathematical Progamming"},{"key":"CR10","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":"CR11","first-page":"29","volume-title":"Progress in Mathematical Programming","author":"M. Kojima","year":"1988","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, \u201cA primal\u2014dual interior point algorithm for linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1988) pp. 29\u201348."},{"key":"CR12","volume-title":"\u201cThe multifrontal method and paging in sparse Cholesky factorization,\u201d Technical Report CS-87-09","author":"J.W.H. Liu","year":"1987","unstructured":"J.W.H. Liu, \u201cThe multifrontal method and paging in sparse Cholesky factorization,\u201d Technical Report CS-87-09, Department of Computer Science, York University (Downsview, Ontario, Canada, 1987a)."},{"key":"CR13","volume-title":"\u201cA collection of routines for an implementation of the multifrontal method,\u201d Technical Report CS-87-10","author":"J.W.H. Liu","year":"1987","unstructured":"J.W.H. Liu, \u201cA collection of routines for an implementation of the multifrontal method,\u201d Technical Report CS-87-10, Department of Computer Science, York University (Downsview, Ontario, Canada, 1987b)."},{"key":"CR14","volume-title":"\u201cA generic primal\u2014dual interior point algorithm,\u201d Technical Report SOR 88-3","author":"I.J. Lustig","year":"1988","unstructured":"I.J. Lustig, \u201cA generic primal\u2014dual interior point algorithm,\u201d Technical Report SOR 88-3, Program in Statistics and Operations Research, Department of Civil Engineering and Operations Research, School of Engineering and Applied Science, Princeton University (Princeton, NJ, 1988)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0305-0548(89)90018-X","volume":"16","author":"I.J. Lustig","year":"1989","unstructured":"I.J. Lustig, \u201cAn analysis of an available set of linear programming test problems,\u201dComputers and Operations Research 16 (1989) 173\u2013184.","journal-title":"Computers and Operations Research"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/ijoc.1.2.70","volume":"1","author":"K.A. McShane","year":"1989","unstructured":"K.A. McShane, C.L. Monma and D.F. Shanno, \u201cAn implementation of a primal\u2014dual interior point method for linear programming,\u201dORSA Journal on Computing 1 (1989) 70\u201383.","journal-title":"ORSA Journal on Computing"},{"key":"CR17","first-page":"131","volume-title":"Progress in Mathematical Programming","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, \u201cPathways to the optimal set in linear programming,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1988) pp. 131\u2013158."},{"key":"CR18","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 affine variant of Karmarkar's method for linear programming,\u201dOperations Research Letters 6 (1987) 261\u2013267.","journal-title":"Operations Research Letters"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF01587075","volume":"44","author":"R.C. Monteiro","year":"1989","unstructured":"R.C. Monteiro and I. Adler, \u201cInterior path following primal\u2014dual algorithms\u2014Part I: linear programming,\u201dMathematical Programming 44 (1989) 27\u201342.","journal-title":"Mathematical Programming"},{"key":"CR20","volume-title":"MINOS 5.1 user's guide, Technical Report SOL 83-20R","author":"B.A. Murtagh","year":"1987","unstructured":"B.A. Murtagh and M.A. Saunders, MINOS 5.1 user's guide, Technical Report SOL 83-20R, Department of Operations Research, Stanford University (Stanford, CA, 1987)."},{"key":"CR21","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 linear programming algorithm,\u201dAlgorithmica 1 (1986) 395\u2013408.","journal-title":"Algorithmica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588785.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588785\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588785","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:36:27Z","timestamp":1556883387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,11]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1990,11]]}},"alternative-id":["BF01588785"],"URL":"https:\/\/doi.org\/10.1007\/bf01588785","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990,11]]}}}