{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:05:27Z","timestamp":1787497527607,"version":"build-2736575974"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998,1]]},"DOI":"10.1007\/bf02680548","type":"journal-article","created":{"date-parts":[[2007,7,27]],"date-time":"2007-07-27T08:52:17Z","timestamp":1185526337000},"page":"1-28","source":"Crossref","is-referenced-by-count":11,"title":["Condition measures and properties of the central trajectory of a linear program"],"prefix":"10.1007","volume":"83","author":[{"given":"Manuel A.","family":"Nunez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert M.","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"BF02680548_CR1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF01594923","volume":"50","author":"I. Adler","year":"1991","unstructured":"I. Adler, R.D.C. Monteiro, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Mathematical Programming 50 (1) (1991) 29\u201351.","journal-title":"Mathematical Programming"},{"issue":"6","key":"BF02680548_CR2","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1016\/0041-5553(81)90148-8","volume":"21","author":"S.A. Ashmanov","year":"1981","unstructured":"S.A. Ashmanov, Stability conditions for linear programming problems, U.S.S.R. Comput. Math. and Math. Phys. 21 (6) (1981) 40\u201349.","journal-title":"U.S.S.R. Comput. Math. and Math. Phys."},{"key":"BF02680548_CR3","volume-title":"Nonlinear Programming, Theory and Algorithms","author":"M.S. Bazaraa","year":"1993","unstructured":"M.S. Bazaraa, H.D. Sherali, C.M. Shetty, Nonlinear Programming, Theory and Algorithms, 2nd ed., Wiley, New York, 1993.","edition":"2nd ed."},{"key":"BF02680548_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."},{"issue":"1","key":"BF02680548_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00940075","volume":"73","author":"D. Hertog Den","year":"1992","unstructured":"D. Den Hertog, C. Roos, T. Terlaky, On the classical logarithmic barrier function method for a class of smooth convex programming problems, Journal of Optimization Theory and Applications 73 (1) (1992) 1\u201325.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"BF02680548_CR6","unstructured":"S. Filipowski, On the complexity of solving linear programs specified with approximate data and known to be feasible, Technical Report, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, May 1994."},{"key":"BF02680548_CR7","unstructured":"S. Filipowski, On the complexity of solving sparse symmetric linear programs specified with approximate data, Technical Report, Department of Industrial and Manufacturing Systems Engineering, Iowa State University, December 1994."},{"issue":"3","key":"BF02680548_CR8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01590957","volume":"71","author":"S. Filopowski","year":"1995","unstructured":"S. Filopowski, On the complexity of solving feasible systems of linear inequalities specified with approximate data, Mathematical Programming 71 (3) (1995) 259\u2013288.","journal-title":"Mathematical Programming"},{"key":"BF02680548_CR9","unstructured":"R.M. Freund, J.R. Vera, Some characterizations and properties of the \u201cdistance to ill-posedness\u201d in conic linear systems, MIT Sloan Working Paper 3862-95-MSA, Sloan School of Management, Massachusetts Institute of Technology, 1995."},{"key":"BF02680548_CR10","volume-title":"The Theory of Linear Economic Models","author":"D. Gale","year":"1960","unstructured":"D. Gale, The Theory of Linear Economic Models, McGraw-Hill, New York, 1960."},{"key":"BF02680548_CR11","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1997","unstructured":"G.H. Golub, C.F. Van Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, New York, 1997.","edition":"3rd ed."},{"issue":"2","key":"BF02680548_CR12","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/1034048","volume":"34","author":"C.C. Gonzaga","year":"1992","unstructured":"C.C. Gonzaga, Path following methods for linear programming, SIAM Review 34 (2) (1992) 167\u2013227.","journal-title":"SIAM Review"},{"key":"BF02680548_CR13","unstructured":"B. Jansen, C. Roos, T. Terlaky, A Short survey on ten years interior point methods, Technical Report 95-45, Delft University of Technology, 1995."},{"issue":"1","key":"BF02680548_CR14","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, A polynomial algorithm in linear programming, Soviet Math. Dokl. 20 (1) (1979) 191\u2013194.","journal-title":"Soviet Math. Dokl."},{"key":"BF02680548_CR15","volume-title":"Optimization by Vector Space Methods","author":"D.G. Luenberger","year":"1968","unstructured":"D.G. Luenberger, Optimization by Vector Space Methods, Wiley, New York, 1968."},{"key":"BF02680548_CR16","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0024-3795(81)90100-2","volume":"41","author":"O.L. Mangasarian","year":"1981","unstructured":"O.L. Mangasarian, A stable theorem of the alternative: An extension of the Gordan theorem, Linear Algebra and Its Applications 41 (1981) 209\u2013223.","journal-title":"Linear Algebra and Its Applications"},{"key":"BF02680548_CR17","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988."},{"key":"BF02680548_CR18","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1994","unstructured":"Y. Nesterov, A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, PA, 1994."},{"issue":"1","key":"BF02680548_CR19","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01581690","volume":"65","author":"J. Renegar","year":"1994","unstructured":"J. Renegar, Some perturbation theory for linear programming, Mathematical Programming 65 (1) (1994) 73\u201391.","journal-title":"Mathematical Programming"},{"issue":"3","key":"BF02680548_CR20","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","volume":"5","author":"J. Renegar","year":"1995","unstructured":"J. Renegar, Incorporating condition measures into the complexity theory of linear programming, SIAM Journal on Optimization 5 (3) (1995) 506\u2013524.","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"BF02680548_CR21","first-page":"279","volume":"70","author":"J. Renegar","year":"1995","unstructured":"J. Renegar, Linear Programming, complexity theory, and elementary functional analysis, Mathematical Programming 70 (3) (1995) 279\u2013351.","journal-title":"Mathematical Programming"},{"issue":"4","key":"BF02680548_CR22","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1137\/S105262349427532X","volume":"6","author":"J. Renegar","year":"1996","unstructured":"J. Renegar, Condition numbers, the barrier method, and the conjugate gradient method, SIAM Journal on Optimization 6 (4) (1996) 879\u2013912.","journal-title":"SIAM Journal on Optimization"},{"issue":"5","key":"BF02680548_CR23","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1137\/0712056","volume":"12","author":"S.M. Robinson","year":"1975","unstructured":"S.M. Robinson, Stability theory for systems of inequalities. Part I: Linear systems, SIAM Journal on Numerical Analysis 12 (5) (1975) 754\u2013769.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"4","key":"BF02680548_CR24","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1137\/0713043","volume":"13","author":"S.M. Robinson","year":"1976","unstructured":"S.M. Robinson, Stability theory for systems of inequalities. Part II: Nonlinear systems, SIAM Journal on Numerical Analysis 13 (4) (1976) 497\u2013513.","journal-title":"SIAM Journal on Numerical Analysis"},{"issue":"3","key":"BF02680548_CR25","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1287\/opre.25.3.435","volume":"25","author":"S.M. Robinson","year":"1977","unstructured":"S.M. Robinson, A characterization of stability in linear programming, Operations Research 25 (3) (1977) 435\u2013447.","journal-title":"Operations Research"},{"key":"BF02680548_CR26","series-title":"Technical Report","first-page":"6","volume-title":"An \u201canalytic\u201d center for polyhedrons and new classes of global algorithms for linear (smooth, convex) optimization","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, An \u201canalytic\u201d center for polyhedrons and new classes of global algorithms for linear (smooth, convex) optimization, Technical Report, Department of Numerical Analysis, Institute of Mathematics, E\u00f6tv\u00f6s University, Budapest, Preprint, 1985, pp. 6\u20138."},{"key":"BF02680548_CR27","series-title":"Technical Report","first-page":"6","volume-title":"A new method for solving a set of linear (convex) inequalities and its applications for identification and optimization","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, A new method for solving a set of linear (convex) inequalities and its applications for identification and optimization, Technical Report, Department of Numerical Analysis, Institute of Mathematics, E\u00f6tv\u00f6s University, Budapest, Preprint, 1985, pp. 6\u20138."},{"key":"BF02680548_CR28","unstructured":"J.R. Vera, Ill-posedness and the computation of solutions to linear programs with approximate data, Technical Report, Cornell University, May 1992."},{"key":"BF02680548_CR29","unstructured":"J.R. Vera, On the complexity of linear programming under finite precision arithmetic, Technical Report, Cornell University, August 1994."},{"issue":"3","key":"BF02680548_CR30","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1137\/S105262349223352X","volume":"6","author":"J.R. Vera","year":"1996","unstructured":"J.R. Vera, Ill-posedness and the complexity of deciding existence of solutions to linear programs, SIAM Journal on Optimization 6 (3) (1996) 549\u2013569.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"BF02680548_CR31","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1137\/1012015","volume":"12","author":"A.C. Williams","year":"1970","unstructured":"A.C. Williams, Complementarity theorems for linear programming, SIAM Review 12(1) (1970) 135\u2013137.","journal-title":"SIAM Review"},{"key":"BF02680548_CR32","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"S.J. Wright, Primal-Dual Interior-Point Methods, SIAM, Philadelphia, PA, 1997."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02680548.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02680548\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02680548","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T07:52:30Z","timestamp":1558338750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02680548"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":32,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["BF02680548"],"URL":"https:\/\/doi.org\/10.1007\/bf02680548","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}